Author:
Boyer John M.,Cortese Pier Francesco,Patrignani Maurizio,Di Battista Giuseppe
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Booth, K., Lueker, G.: Testing for the consecutive ones property interval graphs and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13 (1976)
2. Boyer, J., Myrvold, W.: Stop minding your P’s and Q’s: A simplified O(n) planar embedding algorithm. In: 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 140–146 (1999)
3. Boyer, J., Myrvold, W.: Stop minding your P’s and Q’s: Simplified planarity by edge addition (2003) (submitted), Preprint at http://www.pacificcoast.net/~lightning/planarity.ps
4. Boyer, J.M., Cortese, P., Patrignani, M., Di Battista, G.: Stop minding your P’s and Q’s: Implementing a fast and simple DFS-based planarity testing and embedding algorithm. Tech. Report RT-DIA-83-2003, Dept. of Computer Sci., Univ. di Roma Tre (2003)
5. Chiba, N., Nishizeki, T., Abe, S., Ozawa, T.: A linear algorithm for embedding planar graphs using PQ-trees. J. Comput. Syst. Sci. 30(1), 54–76 (1985)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Drawing Planar Graphs;WALCOM: Algorithms and Computation;2020
2. Multiscale Embedded Gene Co-expression Network Analysis;PLOS Computational Biology;2015-11-30
3. Race Detection in Two Dimensions;Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures;2015-06-13
4. Algorithm Engineering: Concepts and Practice;Experimental Methods for the Analysis of Optimization Algorithms;2010
5. TRÉMAUX TREES AND PLANARITY;International Journal of Foundations of Computer Science;2006-10