|
193
|
Efficient planarity testing
– J Hopcroft, R E Tarjan
- 1974
|
|
406
|
Testing for the consecutive ones properties, interval graphs and graph planarity using PQ-tree algorithm
– K S Booth, G S Lueker
- 1976
|
|
14
|
A characterization of planar graphs by trémaux orders
– H de Fraysseix, P Rosenstiehl
- 1985
|
|
10
|
Stop minding your P's and Q's: Implementing a fast and simple DFS-based planarity testing and embedding algorithm
– J M Boyer, P F Cortese, M Patrignani, G Di Battista
- 2003
|
|
801
|
Depth-first search and linear graph algorithms
– R Tarjan
- 1972
|
|
54
|
Corrigendum: Computing an stnumbering
– S Even, R E Tarjan
- 1977
|
|
16
|
A New Planarity Test
– Wei-kuan Shih, Wen-Lian Hsu
- 1999
|
|
102
|
A linear algorithm for embedding planar graphs using PQ-trees
– N Chiba, T Nishizeki, S Abe, T Ozawa
- 1985
|
|
141
|
Sur le probleme des courbes gauches en topologie, Fund
– K Kuratowski
- 1930
|
|
95
|
An algorithm for planarity testing of graphs
– A Lempel, S Even, I Cederbaum
- 1967
|
|
28
|
On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm
– Kurt Mehlhorn, Petra Mutzel
- 1994
|
|
10
|
Pitfalls of using PQ-Trees in Automatic Graph Drawing
– Michael Jünger, Sebastian Leipert, Petra Mutzel
- 1997
|
|
17
|
On the cutting edge: Simplified O(n) planarity by edge addition
– John M. Boyer, Wendy J. Myrvold
- 2004
|
|
29
|
Depth-first search and Kuratowski subgraphs
– S G Williamson
- 1984
|
|
28
|
Planarizing Graphs -- A Survey and Annotated Bibliography
– Annegret Liebers
- 1999
|
|
7
|
Note on Hopcroft and Tarjan planarity algorithm
– N Deo
- 1976
|
|
283
|
Graph Drawing – Algorithms for the Visualization of Graphs
– G Di Battista, P Eades, R Tamassia, I G Tollis
- 1999
|
|
215
|
Algorithmic Graph Theory
– A Gibbons
- 1985
|
|
3
|
Additional PC-tree planarity conditions
– J M Boyer
- 2004
|
