An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem (1993)

Cached

Download Links

by Jiazhen Cai , Xiaofeng Han , Robert E. Tarjan
Citations:17 - 0 self

Documents Related by Co-Citation

12771 Computers and Intractability; A Guide to the Theory of NP-Completeness – M R Garey, D S Johnson - 1979
527 Testing the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms – K Booth, G Lueker - 1976
25 O(n 2 ) algorithms for graph planarization – R Jayakumar, K Thulasiraman, N Swami - 1989
82 Upward Planarity Testing – Ashim Garg, Roberto Tamassia - 1995
254 Efficient planarity testing – John Hopcroft, Robert Tarjan - 1974
1456 Graph Theory – F Harary - 1969
13 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
16 An algorithm of maximal planarization of graphs – T Chiba, I Nishioka, I Shirakawa - 1979