On the computational complexity of edge concentration

Discrete Applied Mathematics

Volumn 101, Issue 1-3, 2000, Pages 197-205

  Lin, Xuemin ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Bipartite graph; Edge cover; Graph drawing; NP complete

Indexed keywords

EID: 0346673789     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00207-3     Document Type: Article

References (11)

1. J.A. Bondy, U.S.R. Murty, Graph Theory with Application, Macmillan, New York, 1977 .
2. Di Battista G., Eades P.D., Tamassia R., Tollis I. Algorithms for automatic graph drawing. an annotated bibliography Computat. Geom. Theory and Application. 4:1994;235-282.
3. P. Eades, Q. Feng, X. Lin, H. Nagamochi, Straight-line drawing algorithms for hierarchical graphs and clustered graphs, Algorithmica, to appear.
4. Eades P., Lin X., Tamassia R. An algorithm for drawing a hierarchical graph. Internat. J. Comput. Geom. Appl. 6(2):1996;145-155.
5. M.R. Garey, D.S. Johnson, Computers and Intractability: a guide to the Theory of the NP-Completeness, Freeman, New York, 1979 .
6. X. Lin, Analysis of algorithms for drawing graphs, Ph.D. Thesis, University of Queensland, 1992 .
7. F. Newbery, Edge concentration: a method for clustering directed graphs, graph drawing by force-directed placement, International Workshop on Software Configuration Management, Princeton, 1989 .
8. Paulish F.N., Tichy W.F. Edge. An extendible graph editor Software - Practice Experience. 20(s1):1990;63-88.
9. Sugiyama K., Misue K. Graph drawing by the magnetic spring model. J. Visual Languages Comput. 6(3):1995;217-232.
10. D. Tunkelang, A Practical Approach to Drawing Undirected Graphs, TR No. 2, Carnegie Mellon University, 1995 .
11. Warfield J. Crossing theory and hierarchy mapping. IEEE Trans. Systems Man Cybernet. SMC-7(7):1977;502-523.