NP-completeness of some tree-clustering problems

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

Volumn 1547, Issue , 1999, Pages 288-301

  Schreiber, Falk ^a   Skodinis, Konstantinos ^a  

^a UNIVERSITY OF PASSAU   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957880064     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-37623-2_22     Document Type: Conference Paper

References (15)

1. S. Arnborg, D. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Meth., 8:277–384, 1987.
2. F. T. Boesch and J. F. Gimpel. Covering the points of a digraph with point-disjoint paths and its application to code optimization. J. Assoc. Comput. Mach., 24(2):192–198, 1977.
3. F. J. Brandenburg. Graph clustering I: Cycles of cliques. In G. DiBattista, editor, Proc. of Graph Drawing, volume 1353 of Lect. Notes in Comput. Sci., pages 158–168. Springer-Verlag, New York/Berlin, 1997.
4. E. Cohen and M. Tarsi. NP-completeness of graph decomposition problems. J. Complexity, 7:200–212, 1991.
5. D. Dor and M. Tarsi. Graph decomposition is NP-complete: A complete proof of holyer’s conjecture. SIAM J. Comput., 26(4):1166–1187, 1997.
6. P. Eades and Q.-W. Feng. Multilevel visualization of clustered graphs. In S. North, editor, Proc. of Graph Drawing, volume 1190 of Lect. Notes in Comput. Sci., pages 101–112. Springer-Verlag, New York/Berlin, 1996.
7. Q.-W. Feng, R. F. Cohen, and P. Eades. How to draw a planar clustered graph. In D.-Z. Du, editor, Computing and Combinatorics, volume 959 of Lect. Notes in Comput. Sci., pages 21–30. Springer-Verlag, New York/Berlin, 1995.
8. T. Fruchterman and E. Reingold. Graph drawing by force-directed placement. Sof tware - Practi ce and Experience, 21(11):1129–1164, 1991.
9. M. R. Garey and D. S. Johnson. Computers and Intractability; A guide to the theory of NP-completeness. W. H. Freeman, 1979.
10. M. Himsolt. The graphlet system. In S. North, editor, Proc. of Graph Drawing, volume 1190 of Lect. Notes in Comput. Sci., pages 233–240. Springer-Verlag, New York/Berlin, 1996.
11. I. Holyer. The NP-completeness of some edge-partition problems. SIAM J. Com-put., 10(4):713–717, 1981.
12. J. Kratochvíl, M. Goljan, and P. Kučaera. String graphs. Technical report, Academia Prague, 1986.
13. C. Papadimitriou. Computational Complexity. Addison-Wesley Publishing Company, 1994.
14. T. Roxborough and A. Sen. Graph clustering using multiway ratio cut. In G. Di-Battista, editor, Proc. of Graph Drawing, volume 1353 of Lect. Notes in Comput. Sci., pages 291–296. Springer-Verlag, New York/Berlin, 1997.
15. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Transactions on Systems, Man and Cybernetics, 11:109–125, 1981.