Author:
Wei-Kuan Shih,Wen-Lian Hsu
Subject
General Computer Science,Theoretical Computer Science
Reference11 articles.
1. Testing the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms;Booth;J. Comput. System Sci.,1976
2. An O(m log n)-time algorithm for the maximal planar subgraph problem;Cai;SIAM J. Comput.,1993
3. A linear algorithm for embedding planar graphs using PQ-trees;Chiba;J. Comput. System Sci.,1985
4. Efficient planarity testing;Hopcroft;J. Assoc. Comput. Mach.,1974
5. A. Lempel, S. Even, I. Cederbaum, An algorithm for planarity testing of graphs, in: P. Rosenstiehl (Ed.), Theory of Graphs, Gordon and Breach, New York, pp. 215–232.
Cited by
50 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献