Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus (1996)

Cached

Download Links

by L. Aleksandrov , H. Djidjev
Venue:SIAM Journal of Discrete Mathematics
Citations:22 - 4 self

Documents Related by Co-Citation

397 A Separator Theorem for Planar Graphs f – Richard J. Lipton, Robert E. Tarjan - 1977
121 Fast algorithms for shortest paths in planar graphs, with applications – G N Frederickson - 1987
79 Tarjan, A separator theorem for graphs of bounded genus – J R Gilbert, J P Hutchinson, R E - 1984
167 Faster Shortest-Path Algorithms for Planar Graphs – Philip Klein , Satish Rao, Monika Rauch, Sairam Subramanian - 1994
974 Computational Geometry: Algorithms and Applications – M de Berg, M van Kreveld, M Overmars, O Schwarzkopf - 2000
311 Handbook of graph theory – J L Gross, J Yellen - 2003
305 A Data Structure for Dynamic Trees – D D Sleator, R E Tarjan - 1983
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
51 Planar Separators and Parallel Polygon Triangulation – Michael T. Goodrich - 1992
161 Applications of a planar separator theorem – R LIPTON, R E TARJAN - 1980
92 A separator theorem for graphs with an excluded minor and its applications – Noga Alon, Paul Seymour, Robin Thomas - 1990
39 Faster Deterministic Sorting and Searching in Linear Space – Arne Andersson - 1995
55 Optimal Bounds for the Predecessor Problem and Related Problems – Paul Beame, Faith E. Fich - 2001
294 Triangulating a simple polygon in linear time – B Chazelle - 1991
87 Diameter and treewidth in minor-closed graph families – David Eppstein
311 Approximation algorithms for NP-complete problems on planar graphs,Vroc. 24th Ann – B S Baker - 1983
113 Subgraph Isomorphism in Planar Graphs and Related Problems – David Eppstein - 1999
10 Separator based sparsification I: planarity testing and minimum spanning trees – D Eppstein, Z Galil, G F Italiano, T H Spencer - 1996
29 Approximating Shortest Paths on Weighted Polyhedral Surfaces – Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack