Finding large planar subgraphs and large subgraphs of a given genus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1090, Issue , 1996, Pages 152-161

  Călinescu, Gruia ^a   Fernandes, Cristina G ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); GRAPH THEORY;

APPROXIMATION RATIOS; CONNECTED GRAPH; FACILITY LAYOUT; GRAPH DRAWING; MAXIMUM PLANAR SUBGRAPH; PLANAR SUBGRAPHS; SIMPLE ALGORITHM; SUBGRAPH PROBLEMS;

APPROXIMATION ALGORITHMS;

EID: 84948962268     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61332-3_148     Document Type: Conference Paper

References (8)

1. th Annual ACM-SIAM Symp. on Discrete Algorithms, 1996.
2. [CN85] N. Chiba and T. Nishizeki, "Arboricity and Subgraph Listing Algorithms," SIAM Journal of Computing, 14: 210-223, 1985.
3. [F92] L. R. Foulds, Graph Theory Applications, Springer-Verlag, New York, 1992.
4. th Col-loq., Lecture Notes in Computer Science, Vol. 194, 210-220, 1985.
5. th Southeastern Conference on Combinatorics, Graph Theory, and Computing, 727-738, 1977.
6. [LP86] L. Lovász and M. D. Plummer, Matching Theory, Elsevier Science, Amsterdam, 1986.
7. [TDB88] R. Tamassia, G. Di Battista and C. Batini, "Automatic Graph Drawing and Readability of Diagrams," IEEE Transactions on Systems, Man and Cybernetics, 18: 61-79, 1988.
8. [Th89] C. Thomassen, "The Graph Genus Problem is NP-Complete," Journal of Algorithms, 10: 568-576, 1989.