Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Booth, K.S., Lueker, G.S.: Testing the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13, 335–379 (1976)
2. Boyer, J., Myvold, W.: Stop minding your P’s and Q’s: A simplified O(n) embedding algorithm. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 140–149 (1999)
3. Cai, J., Han, X., Tarjan, R.E.: An O(mlogn)-time algorithm for the maximal planar subgraph problem. SIAM J. Comput. 22, 1142–1162 (1993)
4. Chiba, N., Nishizeki, T., Abe, S., Ozawa, T.: A linear algorithm for embedding planar graphs using PQ-trees. J. Comput. Syst. Sci. 30, 54–76 (1985)
5. Hopcroft, J.E., Tarjan, R.E.: Efficient planarity testing. J. Assoc. Comput. Mach. 21, 549–568 (1974)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献