Planarity for clustered graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 979, Issue , 1995, Pages 213-226

  Feng, Qing Wen ^a   Cohen, Robert F ^a   Eades, Peter ^a  

^a UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

CLUSTERED GRAPH; EDGE CROSSING; EDGE REGION; GRAPH MODEL; MATHEMATICAL SCIENCE; PLANAR EMBEDDINGS; PLANARITY;

GRAPHIC METHODS;

EID: 84947731683     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60313-1_145     Document Type: Conference Paper

References (18)

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. Toltis. Algorithms for drawing graphs: An annotated bibliography. Technical report, Department of Computer Science, Brown University, 1993. To appear in Computational Geometry artd Applications, currently available from wflma.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.
6. H. de Fraysseix and P. Rosenstiehl. A depth-first-search characterization of planaxity. Annals of Discrete Mathematics, 13:75-80, 1982.
7. S. Even and R. E. Tarjan. Computing an st-numbering. Theoretical Computer Science, 2:339-344, 1976.
8. M.R. Garey and D.S. Johnson. Crossing number is NP-complete. SIAM J. Algebraic and Discrete Methods, 4(3):312-316, 1983.
9. D. Hard. On visual formalisms. Communications of the ACM, 31(5):514-530, 1988.
10. J. Hopcroft and R. E. Tarjan. Efficient plartarity testing. Journal of ACM, 21(4):549-568, 1974.
11. T. Kamada. Visualizing Abstract Objects and Relations. World Scientific Series in Computer Science, 1989.
12. J. Kawakita. The KJ method - a scientific approach to problem solving. Technical report, Kawakita Research Institute, Tokyo, 1975.
13. A. Lempel, S. Even, and I. Cederbaum. Art algorithm for planarity testing of graphs. In Theory of Graphs, International Symposium (Rome 1966), pages 215-232. Gordon and Breach, New York, 1967.
14. T. Nishizeki and N. Chiba. Planar Graphs: Theory and Algorithms, Annals of Discrete Mathematics 32. North-Holland, 1988.
15. S. C. North. Drawing ranked digraphs with recursive clusters, preprint, 1993. Software Systems and Research Center, AT & T Laboratories.
16. K. Sugiyama and K. Misue. Visualization of structural information: Automatic drawing Of compound digraphs. IEEE Transactions on Systems, Man and Cybernetics, 21(4):876-892, 1991.
17. C. Williams, J. Unsure, and C. Hansen. The state of the art of visual languages for visualization. In Visualization 9P, pages 202-209, 1992.
18. Rebecca Wirfs-Brock, Brian Wilkerson, and Lauren Wiener. Designing Object-Oriented Software. P T R Prentics gall, Englewood Cliffs, NJ 07632, 1990.