Dynamic generators of topologically embedded graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 599-608

  Eppstein, David ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; EQUIVALENCE CLASSES; GRAPH THEORY; THEOREM PROVING;

LOW-GENUS GRAPH; TOPOLOGICALLY EMBEDDED GRAPHS; TREE-COTREE DECOMPOSITION;

DATA STRUCTURES;

EID: 0038077457     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. L. Aleksandrov and H. Djidjev. Linear algorithms for partitioning embedded graphs of bounded genus. SIAM J. Discrete Math. 9:129-150, 1996, http://www.dcs.warwick.ac.uk/~hristo/papers/genus-separator.ps.Z.
2. B. S. Baker. Approximation algorithms for NP-complete problems on planar graphs. J. Assoc. Comput. Mach. 41:153-180, 1994.
3. C. P. Bonnington and C. H. C. Little. The Foundations of Topological Graph Theory. Springer-Verlag, 1995.
4. D. Eppstein. Subgraph isomorphism in planar graphs and related problems. J. Graph Algorithms & Applications 3(3):1-27, 1999, arXiv:cs.DS/9911003.
5. D. Eppstein. Diameter and treewidth in minor-closed graph families. Algorithmica 27:275-291, 2000, arXiv:math.CO/9907126.
6. D. Eppstein, Z. Galil, G. F. Italiano, and T. H. Spencer. Separator based sparsification I: planarity testing and minimum spanning trees. J. Computing & Systems Sciences 52(1):3-27, February 1996.
7. D. Eppstein, G. F. Italiano, R. Tamassia, R. E. Tarjan, J. R. Westbrook, and M. Yung. Maintenance of a minimum spanning forest in a dynamic planar graph. J. Algorithms 13(1):33-54, March 1992.
8. J. Erickson and S. Har-Peled. Optimally cutting a surface into a disk. Proc. 18th ACM Symp. Computational Geometry, pp. 244-253, June 2002, http://compgeom.cs.uiuc.edu/~jeffe/pubs/schema.html, arXiv:cs.CG/0207004.
9. M. Grohe. Local tree-width, excluded minors, and approximation algorithms. arXiv:org e-Print archive, January 2000, arXiv:math.CO/0001128.
10. J. L. Gross and T. W. Tucker. Topological Graph Theory. Dover Publications, 2001.
11. M. R. Henzinger and V. King. Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J. ACM 46(4):502-536, July 1999.
12. J. Holm, K. de Lichtenberg, and M. Thorup. Poly-logarithmic deterministic fully-dynamic graph algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48(4):723-760, July 2001.
13. S. Lins. Graph-encoded maps. J. Combinatorial Theory, Ser. B 32:171-181, 1982.
14. R. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM J. Applied Math. 36(2):177-189, April 1979.
15. D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. J. Computing & Systems Sciences 26:362-391, 1983.
16. D. A. Spielman and S.-H. Teng. Disk packings and planar separators. Proc. 12th ACM Symp. Computational Geometry, pp. 349-358, 1996, http://www-math.mit.edu/~spielman/Research/separator.html.
17. J. Stillwell. Classical Topology and Combinatorial Group Theory. Graduate Texts in Mathematics 72. Springer-Verlag, 2nd edition, 1993.
18. M. Thorup. Near-optimal fully-dynamic graph connectivity. Proc. 32nd ACM Symp. Theory of Computing, pp. 343-350, May 2000.
19. G. Vegter and C.-K. Yap. Computational complexity of combinatorial surfaces. Proc. 6th ACM Symp. Computational Geometry, pp. 102-111, 1990, http://www.acm.org/pubs/citations/proceedings/compgeom/98524/p102-vegter/.