论文信息 - On the complexity of partitioning graphs into connected subgraphs

On the complexity of partitioning graphs into connected subgraphs

Abstract This paper is mainly concerned with the computational complexity of determining whether or not the vertices of a graph can be partitioned into equal sized subsets so that each subset induces a particular type of graph. Many of the NP-completeness results are for planar graphs. These are proved using a planar version of 3-dimensional matching.

Martin E. Dyer | Alan M. Frieze | A. Frieze | M. Dyer

[1] L. Lovász. A homology theory for spanning tress of a graph , 1977 .

[2] Stephen R. Schach,et al. Max-Min Tree Partitioning , 1981, JACM.

[3] Gerhard Reinelt,et al. On partitioning the edges of graphs into connected subgraphs , 1985, J. Graph Theory.

[4] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .

[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[7] Gerard Salton,et al. Dynamic information and library processing , 1975 .

[8] Mihalis Yannakakis,et al. The Clique Problem for Planar Graphs , 1981, Inf. Process. Lett..

[9] Eugene L. Lawler,et al. The recognition of Series Parallel digraphs , 1979, SIAM J. Comput..

[10] David Lichtenstein,et al. Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[11] Ian Holyer,et al. The NP-Completeness of Some Edge-Partition Problems , 1981, SIAM J. Comput..

[12] Michael Randolph Garey,et al. Johnson: "computers and intractability , 1979 .

[13] John E. Hopcroft,et al. Complexity of Computer Computations , 1974, IFIP Congress.

[14] M. Malik,et al. Operating Systems , 1992, Lecture Notes in Computer Science.