Author:
Feng Qing-Wen,Cohen Robert F.,Eades Peter
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
2. G. Di Battista, P. Eades, R. Tamassia, and I. Tollis. Algorithms for drawing graphs: An annotated bibliography. Technical report, Department of Computer Science, Brown University, 1993. To appear in Computational Geometry and Applications, currently available from wilma.cs.brown.edu by ftp.
3. Claude Berge. Hypergraphs. North-Holland, 1989.
4. K. Booth and G. Lueker. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences, 13:335–379, 1976.
5. N. Chiba, T. Nishizeki, S. Abe, and T. Ozawa. A linear algorithm for embedding planar graphs using PQ-trees. J. of Computer and Sytem Sciences, 30(1):54–76, 1985.
Cited by
75 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献