A New Planarity Test (1999)

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

Active Bibliography

5 A linear time algorithm for finding a maximal planar subgraph based on PC-trees – Wen-lian Hsu - 2005
3 An efficient implementation of the PC-trees algorithm of shih and hsu’s planarity test – Wen-lian Hsu - 2003
674 LEDA: A Platform for Combinatorial and Geometric Computing – Kurt Mehlhorn, Stefan Näher, Christian Uhrig - 1999
544 A Framework for Dynamic Graph Drawing – Robert F. Cohen, G. Di Battista, R. Tamassia, Ioannis G. Tollis - 1992
370 Graph visualization and navigation in information visualization: A survey – Ivan Herman, Guy Melançon, M Scott Marshall
PQ Trees, PC Trees, and Planar Graphs – Wen-Lian Hsu, Ross M. McConnell - 2001
8 From Algorithms to Working Programs On the Use of Program Checking in LEDA – Kurt Mehlhorn, Stefan Näher - 1998
146 Appearance-preserving simplification – Jonathan Cohen, Marc Olano, Dinesh Manocha - 1998
108 Fixed Parameter Algorithms for Dominating Set and Related Problems on Planar Graphs – Jochen Alber, Hans L. Bodlaender, Henning Fernau, Ton Kloks, Rolf Niedermeier - 2002