Recursive Separator Decompositions for Planar Graphs
Publisher
Springer New York
Reference22 articles.
1. Alon N, Seymour PD, Thomas R (1990) A separator theorem for graphs with an excluded minor and its applications. In: Proceedings of the 22nd annual ACM symposium on theory of computing (STOC), Baltimore, pp 293–299
2. Arge L, van Walderveen F, Zeh N (2013) Multiway simple cycle separators and I/O-efficient algorithms for planar graphs. In: Proceedings of the 24th annual ACM-SIAM symposium on discrete algorithms (SODA), New Orleans, pp 901–918
3. Borradaile G, Klein PN, Mozes S, Nussbaum Y, Wulff-Nilsen C (2011) Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time. In: Proceedings of the 52nd annual symposium on foundations of computer science (FOCS), Palm Springs, pp 170–179
4. Eppstein D, Galil Z, Italiano GF, Spencer TH (1993) Separator based sparsification for dynamic planar graph algorithms. In: Proceedings of the 25th symposium theory of computing, San Diego. ACM, pp 208–217.
http://www.acm.org/pubs/citations/proceedings/stoc/167088/p208-eppstein/
5. Fakcharoenphol J, Rao S (2006) Planar graphs, negative weight edges, shortest paths, and near linear time. J Comput Syst Sci 72(5):868–889.
http://dx.doi.org/10.1016/j.jcss.2005.05.007
, preliminary version in FOCS 2001