Years and Authors of Summarized Original Work
1987; Frederickson
1995; Goodrich
2013; Klein, Mozes, Sommer
Problem Definition
Graph decompositions are the basis for many divide-and-conquer algorithms. Two main properties make a decomposition useful. The first is balance, namely, that the parts of the decomposition have roughly the same size. Balanced decompositions lead to logarithmic depth recursion. The second is small overlap between the parts of the decomposition. The overlap affects the time it takes to combine solutions of different parts into a solution for the union of the parts.
A decomposition of a graph G is a collection of subgraphs of G, called regions, whose union is G. A decomposition tree of G is a tree \(\mathcal{T}\) whose nodes correspond to subgraphs of G. The root of \(\mathcal{T}\) consists of the entire graph G. For a node v of \(\mathcal{T}\) that corresponds to a subgraph R, the children \(v_{1},v_{2},\ldots,v_{k}\) of v correspond to subgraphs of Rwhose...
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
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
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
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
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/
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
Frederickson GN (1987) Fast algorithms for shortest paths in planar graphs with applications. SIAM J Comput 16:1004–1022
Goodrich MT (1995) Planar separators and parallel polygon triangulation. J Comput Syst Sci 51(3):374–389
Henzinger MR, Klein PN, Rao S, Subramanian S (1997) Faster shortest-path algorithms for planar graphs. J Comput Syst Sci 55(1):3–23. doi:10.1145/195058.195092
Italiano GF, Nussbaum Y, Sankowski P, Wulff-Nilsen C (2011) Improved algorithms for min cut and max flow in undirected planar graphs. In: Proceedings of the 43rd annual ACM symposium on theory of computing (STOC). ACM, New York, pp 313–322. http://doi.acm.org/10.1145/1993636.1993679,http://doi.acm.org/10.1145/1993636.1993679
Johnson DB, Venkatesan S (1982) Using divide and conquer to find flows in directed planar networks in O(n3∕2logn) time. In: Proceedings of the 20th annual allerton conference on communication, control, and computing, Monticello, pp 898–905
Kawarabayashi K, Reed BA (2010) A separator theorem in minor-closed classes. In: 51th annual IEEE symposium on foundations of computer science (FOCS), Las Vegas, pp 153–162
Klein PN, Subramanian S (1998) A fully dynamic approximation scheme for shortest paths in planar graphs. Algorithmica 22(3):235–249
Klein PN, Mozes S, Weimann O (2010) Shortest paths in directed planar graphs with negative lengths: a linear-space O(nlog2n)-time algorithm. ACM Trans Algorithms 6(2):1–18. http://doi.acm.org/10.1145/1721837.1721846, preliminary version in SODA 2009
Klein PN, Mozes S, Sommer C (2013) Structured recursive separator decompositions for planar graphs in linear time. In: Symposium on theory of computing conference (STOC), Palo Alto, pp 505–514
Koutis I, Miller GL (2007) A linear work, o(n1/6) time, parallel algorithm for solving planar laplacians. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, society for industrial and applied mathematics (SODA ’07), Philadelphia,pp 1002–1011. http://dl.acm.org/citation.cfm?id=1283383.1283491
Lipton RJ, Tarjan RE (1979) A separator theorem for planar graphs. SIAM J Appl Math 36(2):177–189
Lipton RJ, Tarjan RE (1980) Applications of a planar separator theorem. SIAM J Comput 9(3):615–627
Lipton RJ, Rose DJ, Tarjan RE (1979) Generalized nested dissection. SIAM J Numer Anal 16:346–358
Miller GL (1986) Finding small simple cycle separators for 2-connected planar graphs.J Comput Syst Sci 32(3):265–279. doi:10.1016/0022-0000(86)90030-9
Miller GL, Peng R (2013) Approximate maximum flow on separable undirected graphs. In: Proceedings of the twenty-fourth annual ACM-SIAM symposium on discrete algorithms (SODA), New Orleans, pp 1151–1170
Mozes S, Wulff-Nilsen C (2010) Shortest paths in planar graphs with real lengths in O(nlog2n∕loglogn) time. In: Proceedings of the 18th European symposium on algorithms (ESA), Liverpool, pp 206–217
Sleator D, Tarjan R (1983) A data structure for dynamic trees. J Comput Syst Sci 26(3):362–391. doi:10.1016/0022-0000(83)90006-5
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Mozes, S. (2016). Recursive Separator Decompositions for Planar Graphs. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_682
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_682
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering