Graph clustering I: Cycles of cliques

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

Volumn 1353, Issue , 1997, Pages 158-168

  Brandenburg, F J ^a  

^a UNIVERSITY OF PASSAU   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

CLUSTERED GRAPH; GRAPH CLUSTERING; LEVEL GRAPHS; NP-HARD; PLANAR GRAPH; TWO PHASE METHOD;

GRAPH THEORY;

EID: 84957366611     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63938-1_59     Document Type: Conference Paper

References (25)

1. C.J. Alpert and A.B. Kahng: Recent directions in netlist partitioning: a survey. Integration, the VLSI J. 19 (1995), 1-18.
2. J. Bosik: Decompositions of Graphs. Kluvwer Academic Publishers, Dordrecht (1990).
3. F.J. Brandenburg: Designing graph drawings by layout graph grammars. Graph Drawing 94, LNCS 894 (1995), 416-427.
4. R.C. Brewster, P. Hell and G. MacGillivray: The complexity of restricted graph homomorphisms. Discrete Mathematics 167/168 (1997), 145-154.
5. U. Dogrusöz, B. Madden and P. Madden: Circular layout in the graph layout toolkit. Graph Drawing 96, LNCS 1190 (1997), 92-100.
6. D. Dor and M Tarsi: Graph decomposition is NP-complete: proof of Holyer’s conjecture. SIAM J. Comput. 26 (1997), 1166-1187.
7. P. Eades and Q.W. Feng: Multilevel visualization of clustered graphs. Graph Drawing 96, LNCS 1190 (1997), 101-112.
8. P. Eades, Q.W. Feng and X. Lin: Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Graph Drawing 96, LNCS 1190 (1997), 113-128.
9. P. Eades, J. Marks and S. North: Graph-Drawing Contest Report. Graph Drawing 96, LNCS 1190 (1997), 129-138.
10. M.R. Garey and D.S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Fransisco (1979).
11. D.J. Gschwindt and T.P. Murthagh: A recursive algorithm for drawing hierarchical graphs. Technical Report CS -89-02, Williams College, Williamstown (1989).
12. D. Hard: On visual formalisms. Comm. ACM 31 (1988), 514-530.
13. P. Hell and J. Nešetřil: On the complexity of H-coloring. J. of Combinatorial Theory, Series B 48 (1990), 92-110.
14. M. Himsolt: Konzeption und hnplementierung von Grapheditoren. Shaker Verlag, Aachen (1993).
15. I. Holyer: The NP-completeness of some edge partition problems. SIAM J. Comput., 10 (1981), 713-717.
16. J. Kratochvíl: String Graphs. II. Recognizing string graphs is NP-Hard. J. of Combinatorial Theory, Series B 52 (1991), 67-78.
17. J. Kratochvíl, M. Goljan and P. Kučera: String Graphs. Academia, Prague (1986).
18. T. Lengauer: Combinatorial Algorithms for Integrated Circuit Layout. Wiley-Teubner Series (1990).
19. U. Manber: Introduction to Algorithms a Creative Approach. Addison Wesley, Reading (1989).
20. E.B. Messinger, L.A. Rowe and R.R. Henry: A divide-and conquer algorithm for the automatic layout of large directed graphs. IEEE Trans. Systems Man Cybernetics 21 (1991), 1-12.
21. R. Sablowski and A. Frick: Automatic graph clustering. Graph Drawing 96, LNCS 1190 (1997), 396-400.
22. F.-S. Shieh and C.L. McCreary: Directed graphs drawing by clan-based decomposition. Graph Drawing 95, LNCS 1027 (1996), 472-482.
23. K. Sugiyama and K. Misue: Visualization of structural information: automatic drawing of compound graphs. IEEE Trans. Systems Man Cybernetics 21 (1991), 876-892.
24. R.E. Tarjan: Decomposition by clique separators. Discrete Math. 55 (1985), 221-232.
25. S.H. Whitesides: An algorithm for finding clique cut-sets. Inf. Proc. Letters 12 (1981), 31-32.