A New Planarity Test (1999)

Cached

Download Links

by Wei-kuan Shih , Wen-Lian Hsu
Citations:18 - 2 self

Documents Related by Co-Citation

226 Efficient planarity testing – John Hopcroft, Robert, Tar Jan - 1974
468 Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms – K S Booth, G S Lueker - 1976
112 A linear algorithm for embedding planar graphs using PQ-trees – N Chiba, T Nishizeki, S Abe, T Ozawa - 1985
104 Cederbaum I. An algorithm for planarity testing of graphs – A Lempel, S Even - 1967
380 HOW TO DRAW A Graph – W. T. Tutte - 1963
62 Computing an st-numbering – S Even, R E Tarjan - 1976
15 A characterization of planar graphs by Trémaux orders – H de Fraysseix, P Rosenstiehl - 1985
992 Depth first search and linear graph algorithms – Robert Tarjan - 1972
18 Embedding graphs in the plane – algorithmic aspects – S G Williamson
34 On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm – Kurt Mehlhorn, Petra Mutzel - 1994
24 Stop Minding Your P's and Q's: A Simplified O(n) Planar Embedding Algorithm – John Boyer, Wendy Myrvold - 1999
22 A New Look at Fault Tolerant Network Routing – Danny Dolev, Joe Halpern, Barbara Simons, Ray Strong - 1984
33 Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs – J Cheriyan, S N Maheshwari - 1988
59 The Multi-Tree Approach to Reliability in Distributed Networks – Alon Itai, Michael Rodeh - 1984
25 Three tree-paths – A Zehavi, A Itai - 1989
45 A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph – H Nagamochi, T Ibaraki - 1992
17 Independent trees in graphs – A Huck - 1994
10 Pitfalls of using PQ-Trees in Automatic Graph Drawing – Michael Jünger, Sebastian Leipert, Petra Mutzel - 1997
8 PC-trees vs. PQ-trees – Wen-lian Hsu