Planarizing Graphs -- A Survey and Annotated Bibliography (1999)

Cached

Download Links

by Annegret Liebers
Citations:32 - 0 self

Documents Related by Co-Citation

31 On the deletion of nonplanar edges of a graph – P Liu, R Geldmacher - 1977
212 Crossing number is NP-complete – M R Garey, D S Johnson - 1983
230 Efficient planarity testing – J E Hopcroft, R E Tarjan - 1974
166 Sur le problème des courbes gauches en topologie – K Kuratowski - 1930
33 Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools – Michael Jünger, Petra Mutzel - 1996
4 The splitting number of the complete graph – N Hartfield, B Jackson, G Ringel - 1985
4 The splitting number of complete bipartite graphs – B Jackson, G Ringel - 1984
5 Heuristics for planarization by vertex splitting – P Eades, C F X de Mendonca - 1993
27 Determining the thickness of a graph is np-hard – A Mansfield - 1983
29 A Better Approximation Algorithm for Finding Planar Subgraphs – Gruia Calinescu , Cristina G. Fernandes, Ulrich Finkler, Howard Karloff - 1996
25 Stop Minding Your P's and Q's: A Simplified O(n) Planar Embedding Algorithm – John Boyer, Wendy Myrvold - 1999
97 Complexity Issues in VLSI – F T Leighton - 1983
1132 Graph Theory – F Harary - 1969
232 Algorithms for drawing graphs: An annotated bibliography – G Di Battista, P Eades, R Tamassia, I G Tollis - 1994
49 Generating Random Regular Graphs Quickly – A. Steger, N.C. Wormald - 1999
333 Graph Drawing: Algorithms for the visualization of graphs – G Di Battista, P Eades, R Tamassia, I G Tollis - 1999
18 The thickness of the complete graph – L W Beineke, F Harary - 1965
19 A New Planarity Test – Wei-kuan Shih, Wen-Lian Hsu - 1999
10988 Computers and Intractability: A Guide to the Theory of NP-completeness – M Garey, D Johnson - 1979