Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. K. Booth, G. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithm, J. Comp. Syst. Sci. 13, 1976, pp. 335–379.
2. J. Cai, X. Han, and R.E. Tarjan, An O(m log n)-time algorithm for the maximal planar subgraph, SIAM Journal on Computing, 22 (1993), 1142–1162.
3. G. Di Battista, R. Tamassia, Incremental planarity testing, Proc. IEEE Symp. on Found. of Comp. Sci., (1989), 436–441.
4. G. Di Battista, R. Tamassia, On-line graph algorithms with SPQR trees, Proc. Intern. Colloquium on Automata, Languages and Programming (1990), 598–611.
5. H. N. Djidjev, On some properties of nonplanar graphs, Compt. rend. Acad. bulg. Sci., vol. 37 (1984), 9, 1183–1185.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献