|
406
|
G.: Testing for the consecutive ones property, interval graphs and graph planarity using PQ-trees
– K Booth, Lueker
- 1976
|
|
25
|
O(n ) algorithms for graph planarization
– R Jayakumar, K Thulasiraman, N Swami
- 1989
|
|
74
|
Upward Planarity Testing
– Ashim Garg, Roberto Tamassia
- 1995
|
|
193
|
Tarjan, Efficient planarity testing
– J E Hopcroft, R E
- 1974
|
|
14
|
An e cient graph planarization two-phase heuristic
– O Goldschmidt, A Takvorian
- 1994
|
|
17
|
An O(n2) maximal planarization algorithm based on PQ-trees
– G Kant
- 1992
|
|
15
|
An algorithm of maximal planarization of graphs
– T Chiba, I Nishioka, I Shirakawa
|
|
8880
|
Computers and Intractability: A Guide to the Theory of NPCompleteness
– M R Garey, D S Johnson
- 1979
|
|
29
|
On the deletion of nonplanar edges of a graph
– P C Liu, R C Geldmacher
- 1977
|
|
95
|
An algorithm for planarity testing of graphs
– A Lempel, S Even, I Cederbaum
- 1967
|
|
10
|
A graph-planarization algorithm and its applications to random graphs
– T Ozawa, H Takahashi
- 1981
|
|
883
|
Graph Theory
– F Harary
- 1969
|
|
88
|
Automatic graph drawing and readability of diagrams
– Roberto Tamassia, Giuseppe Di Battista, Carlo Batini
- 1988
|
|
54
|
Corrigendum: Computing an stnumbering
– S Even, R E Tarjan
- 1977
|
|
312
|
Graph Algorithms
– S Even
- 1979
|
|
8
|
On Heuristics for Determining the Thickness of a Graph
– Robert Cimikowski
- 1995
|
|
72
|
Planar Graphs: Theory and Algorithms
– T Nishizeki, N Chiba
- 1988
|
|
10
|
Graph theoretic heuristics for the plant layout problem
– L R Foulds, R W Robinson
- 1978
|
|
30
|
Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools
– Michael Jünger, Petra Mutzel
- 1996
|
