Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Further Results
Conclusion
Proofs for Section 5 (Further Results)
References

Star Partitions of Perfect Graphs

Profile image of Robert BredereckRobert Bredereck

2014, Lecture Notes in Computer Science

Abstract

The partition of graphs into nice subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into stars, a problem known to be NP-complete even for the case of stars on three vertices. We perform a thorough computational complexity study of the problem on subclasses of perfect graphs and identify several polynomial-time solvable and NP-hard cases, for example, on interval graphs, grid graphs, and bipartite permutation graphs.

Related papers

A polynomial characterization of some graph partitioning problems
Claudio Arbib

Information Processing Letters, 1988

The Uniform Partition (UP) and the Simple Max Partition (SMP) problems arc NP-complete graph partitioning problems, and polynomial-time algorithms are known for few classes of graphs only. In the present paper, the class of line-graphs is considered and a polynomial algorithm is proposed to solve both problems in this class. When the instance space is extended to digraphs, a characterization is possible which leads to similar results.

View PDFchevron_right
On Satisfactory Partitioning of Graphs
Khurram Shafique

2002

View PDFchevron_right
Complete partitions of graphs
Magnus M. Halldorsson

Combinatorica, 2007

A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a complete partition of G. This measure was defined in 1969 by Gupta [G69], and is known to be NP-hard to compute for several classes of graphs. We obtain essentially tight lower and upper bounds on the approximability of this problem. We show that there is a randomized polynomial-time algorithm that given a graph G with n vertices, produces a complete partition of size Ω(cp(G)/ √ lg n). This algorithm can be derandomized. We show that the upper bound is essentially tight: there is a constant C > 1, such that if there is a randomized polynomial-time algorithm that for all large n, when given a graph G with n vertices produces a complete partition into at least C · cp(G)/ √ lg n classes, then NP ⊆ RTime(n O(lg lg n) ). The problem of finding a complete partition of a graph is thus the first natural problem whose approximation threshold has been determined to be of the form Θ((lg n) c ) for some constant c strictly between 0 and 1. * The work reported here is a merger of the results reported in [KRS05] and .

View PDFchevron_right
Complexity of the satisfactory partition problem
Zsolt Tuza

The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighbors in its part as in the other part. This problem was introduced by Gerber and Kobler (GK98, GK00) and further studied by other authors but its complexity re- mained open until now. We prove in this paper that Satisfactory Partition, as well as a variant where the parts are required to be of the same cardinality, are NP-complete. However, for graphs with maximum degree at most 4 the problem is polynomially solv- able. We also study generalizations and variants of this problem where a partition into k nonempty parts (k 3) is requested.

View PDFchevron_right
Graph partitions with prescribed patterns
Pavol Hell

European Journal of Combinatorics, 2014

We discuss partition problems that generalize graph colouring and homomorphism problems, and occur frequently in the study of perfect graphs. Depending on the pattern, we seek a finite forbidden induced subgraph characterization, or at least a polynomial time algorithm. We give an overview of the current knowledge, focusing on open problems and recent breakthroughs.

View PDFchevron_right
A Graph Partition Problem
Peter Cameron

The American Mathematical Monthly, 2015

Given a graph G on n vertices, for which m is it possible to partition the edge set of the m-fold complete graph mK n into copies of G? We show that there is an integer m 0 , which we call the partition modulus of G, such that the set M (G) of values of m for which such a partition exists consists of all but finitely many multiples of m 0. Trivial divisibility conditions derived from G give an integer m 1 which divides m 0 ; we call the quotient m 0 /m 1 the partition index of G. It seems that most graphs G have partition index equal to 1, but we give two infinite families of graphs for which this is not true. We also compute M (G) for various graphs, and outline some connections between our problem and the existence of designs of various types.

View PDFchevron_right
The complexity of the Pk partition problem and related problems in bipartite graphs
Jérôme Monnot

In this paper, we continue the investigation made in about the approximability of P k partition problems, but focusing here on their complexity. Precisely, we aim at designing the frontier between polynomial and NP-complete versions of the P k partition problem in bipartite graphs, according to both the constant k and the maximum degree of the input graph. We actually extend the obtained results to more general classes of problems, namely, the minimum k-path partition problem and the maximum P k packing problem. Moreover, we propose some simple approximation algorithms for those problems.

View PDFchevron_right
NP-completeness Results for Partitioning a Graph into Total Dominating Sets
Aristocrat Research

A total domatic k-partition of a graph is a partition of its vertex set into k subsets such that each intersects the open neighborhood of each vertex. The maximum k for which a total domatic k-partition exists is known as the total domatic number of a graph G, denoted by dt(G). We extend considerably the known hardness results by showing it is NP-complete to decide whether dt(G) ≥ 3 where G is a bipartite planar graph of bounded maximum degree. Similarly, for every k ≥ 3, it is NP-complete to decide whether dt(G) ≥ k, where G is a split graph or k-regular. In particular, these results complement recent combinatorial results regarding dt(G) on some of these graph classes by showing that the known results are, in a sense, best possible. Finally, for general n-vertex graphs, we show the problem is solvable in 2 n n O(1) time, and derive even faster algorithms for special graph classes.

View PDFchevron_right
NP-completeness results for some problems on subclasses of bipartite and chordal graphs
Stavros D. Nikolopoulos

Theoretical Computer Science, 2007

Extending previous NP-completeness results for the harmonious coloring problem and the pair-complete coloring problem on trees, bipartite graphs and cographs, we prove that these problems are also NP-complete on connected bipartite permutation graphs. We also study the k-path partition problem and, motivated by a recent work of Steiner [G. Steiner, On the k-path partition of graphs, Theoret. Comput. Sci. 290 (2003Sci. 290 ( ) 2147Sci. 290 ( -2155]], where he left the problem open for the class of convex graphs, we prove that the kpath partition problem is NP-complete on convex graphs. Moreover, we study the complexity of these problems on two well-known subclasses of chordal graphs namely quasi-threshold and threshold graphs. Based on the work of Bodlaender [H.L. Bodlaender, Achromatic number is NP-complete for cographs and interval graphs, Inform. Process. Lett. 31 (1989) 135-138], we show NPcompleteness results for the pair-complete coloring and harmonious coloring problems on quasi-threshold graphs. Concerning the k-path partition problem, we prove that it is also NP-complete on this class of graphs. It is known that both the harmonious coloring problem and the k-path partition problem are polynomially solvable on threshold graphs. We show that the pair-complete coloring problem is also polynomially solvable on threshold graphs by describing a linear-time algorithm.

View PDFchevron_right
On a graph partitioning problem with applications to VLSI layout
Hirendra Deora

1992

View PDFchevron_right

References (34)

  1. K. Asdre and S. D. Nikolopoulos. NP-completeness results for some problems on subclasses of bipartite and chordal graphs. Theor. Comput. Sci., 381 (1-3):248-259, 2007.
  2. F. Berman, D. Johnson, T. Leighton, P. W. Shor, and L. Snyder. Generalized planar matching. J. Algorithms, 11(2):153-184, 1990.
  3. R. van Bevern, R. Bredereck, J. Chen, V. Froese, R. Niedermeier, and G. J. Woeginger. Network-based dissolution. Manuscript, TU Berlin, Feb. 2014. arXiv:1402.2664 [cs.DM].
  4. A. Brandstädt, V. B. Le, and J. P. Spinrad. Graph Classes: a Survey, volume 3 of SIAM Monographs on Discrete Mathematics and Applications. SIAM, 1999.
  5. D. Corneil, Y. Perl, and L. Stewart. A linear recognition algorithm for cographs. SIAM J. Comput., 14(4):926-934, 1985.
  6. G. Cornuéjols. General factors of graphs. J. Combin. Theory Ser. B, 45(2): 185-198, 1988.
  7. E. Dahlhaus and M. Karpinski. Matching and multidimensional matching in chordal and strongly chordal graphs. Discrete Appl. Math., 84(1-3):79-91, 1998.
  8. K. M. J. De Bontridder, B. V. Halldórsson, M. M. Halldórsson, C. A. J. Hurkens, J. K. Lenstra, R. Ravi, and L. Stougie. Approximation algorithms for the test cover problem. Math. Program., 98(1-3):477-491, 2003.
  9. M. E. Dyer and A. M. Frieze. On the complexity of partitioning graphs into connected subgraphs. Discrete Appl. Math., 10(2):139-153, 1985.
  10. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics. Elsevier, Amsterdam, Boston, Paris, 2004.
  11. R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum, New York, 1972.
  12. D. G. Kirkpatrick and P. Hell. On the complexity of general graph factor problems. SIAM J. Comput., 12(3):601-608, 1983.
  13. A. Kosowski, M. Ma lafiejski, and P. Ży ĺinski. Parallel processing subsystems with redundancy in a distributed environment. In Parallel Processing and Applied Mathematics, 6th International Conference, PPAM 2005, volume 3911 of LNCS, pages 1002-1009. Springer, 2006.
  14. M. Ma lafiejski and P. Żyliński. Weakly cooperative guards in grids. In Proc. 5th ICCSA, volume 3480 of LNCS, pages 647-656, 2005.
  15. J. Monnot and S. Toulouse. The path partition problem and related problems in bipartite graphs. Oper. Res. Lett., 35(5):677-684, 2007.
  16. J. M. M. van Rooij, M. E. van Kooten Niekerk, and H. L. Bodlaender. Partition into triangles on bounded degree graphs. Theory Comput. Syst., 52(4):687-718, 2013.
  17. P. Rosenstiehl and R. E. Tarjan. Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom., 1(1):343-353, 1986.
  18. J. Spinrad, A. Brandstädt, and L. Stewart. Bipartite permutation graphs. Discrete Appl. Math., 18(3):279-292, 1987.
  19. G. Steiner. On the k-path partition problem in cographs. Congressus Numerantium, 147:89-96, 2000.
  20. G. Steiner. On the k-path partition of graphs. Theor. Comput. Sci., 290(3): 2147-2155, 2003.
  21. K. Takamizawa, T. Nishizeki, and N. Saito. Linear-time computability of combinatorial problems on series-parallel graphs. J. ACM, 29(3):623-641, 1982.
  22. J.-H. Yan, J.-J. Chen, and G. J. Chang. Quasi-threshold graphs. Discrete Appl. Math., 69(3):247-255, 1996.
  23. J.-H. Yan, G. J. Chang, S. M. Hedetniemi, and S. T. Hedetniemi. k-path partitions in trees. Discrete Appl. Math., 78(1-3):227-233, 1997.
  24. R. Yuster. Combinatorial and computational aspects of graph packing and graph decomposition. Computer Science Review, 1(1):12-26, 2007. Bibliography of the appendix
  25. R. van Bevern, C. Komusiewicz, H. Moser, and R. Niedermeier. Measuring indifference: Unit Interval Vertex Deletion. In Proc. 36th WG, volume 6410 of LNCS, pages 232-243, 2010.
  26. D. Corneil, Y. Perl, and L. Stewart. A linear recognition algorithm for cographs. SIAM J. Comput., 14(4):926-934, 1985.
  27. D. G. Corneil, S. Olariu, and L. Stewart. The LBFS structure and recognition of interval graphs. SIAM J. Discrete Math., 23(4):1905-1953, 2009.
  28. G. Cornuéjols. General factors of graphs. J. Combin. Theory Ser. B, 45(2): 185-198, 1988.
  29. M. E. Dyer and A. M. Frieze. On the complexity of partitioning graphs into connected subgraphs. Discrete Appl. Math., 10(2):139-153, 1985.
  30. M. E. Dyer and A. M. Frieze. Planar 3DM is NP-complete. J. Algorithms, 7(2):174-184, 1986.
  31. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
  32. B. S. Panda and S. K. Das. A linear time recognition algorithm for proper interval graphs. Inf. Process. Lett., 87(3):153-161, 2003.
  33. A. Schrijver. Combinatorial Optimization: Polyhedra and Efficiency, vol- ume A. Springer, 2003.
  34. J. Spinrad, A. Brandstädt, and L. Stewart. Bipartite permutation graphs. Discrete Appl. Math., 18(3):279-292, 1987.

Related papers

Partitioning Perfect Graphs into Stars
Robert Bredereck

Journal of Graph Theory, 2016

The partition of graphs into "nice" subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same-size stars, a problem known to be NPcomplete even for the case of stars on three vertices. We perform a thorough computational complexity study of the problem on subclasses of perfect graphs and identify several polynomial-time solvable cases, for example, on interval graphs and bipartite permutation graphs, and also NP-complete cases, for example, on grid graphs and chordal graphs.

View PDFchevron_right
Star partitions on graphs
Luigi De Giovanni

Discrete Optimization, 2019

Given an undirected graph, a star partition is a partition of the nodes into subsets with at least two nodes so that the subgraph induced by each subset has a spanning star. Star partitions are related to well-known problems concerning domination in graphs and edge covering. We focus on the Constrained Star Partition Problem (CSP) that asks for finding a star partition of given cardinality. The problem is new and presents interesting peculiarities. We explore the relation between the cardinalities of star partitions and domatic bipartitions, showing that there are star partitions of any cardinality between minimum and maximum values, and that a similar but weaker result holds for domatic bipartitions. We study the computational complexity of different versions of star partition and domatic bipartition problems, proving that most of them, in particular CSP, constrained domatic bipartition and balanced domatic bipartition, are NP-complete. We also show that star partition problems are polynomial on trees and, more generally, on bounded treewidth graphs. We introduce an integer linear programming formulation that defines a polytope containing all the star partitions of a graph, showing that its vertices have only integral components for trees, which implies that linear programming can be used to solve weighted star partition problems on trees.

View PDFchevron_right
Perfect matching cuts partitioning a graph into complementary subgraphs
Julliano Nascimento

arXiv (Cornell University), 2022

In Partition Into Complementary Subgraphs (Comp-Sub) we are given a graph G = (V, E), and an edge set property Π, and asked whether G can be decomposed into two graphs, H and its complement H, for some graph H, in such a way that the edge cut [V (H), V (H)] satisfies the property Π. Motivated by previous work, we consider Comp-Sub(Π) when the property Π = PM specifies that the edge cut of the decomposition is a perfect matching. We prove that Comp-Sub(PM) is GI-hard when the graph G is {C k≥7 , C k≥7 }free. On the other hand, we show that Comp-Sub(PM) is polynomial time solvable on hole-free graphs and on P5-free graphs. Furthermore, we present characterizations of Comp-Sub(PM) on chordal, distancehereditary, and extended P4-laden graphs.

View PDFchevron_right
Connected subgraphs, matching, and partitions
Herve Kerivin

HAL (Le Centre pour la Communication Scientifique Directe), 2023

Given an undirected graph G and a real edge-weight vector, the connected subgraph problem consists of finding a maximum-weight subset of edges which induces a connected subgraph of G. In this paper, we establish a link between the complexity of the connected subgraph problem and the matching number. We study the separation problem associated with the Matching-partition inequalities wich are introduced by Didi Biha et al. [4] for the connected subgraph polytope.

View PDFchevron_right
Partitioning a Graph into Complementary Subgraphs
Julliano Nascimento

Graphs and Combinatorics, 2021

In the PARTITION INTO COMPLEMENTARY SUBGRAPHS (COMP-SUB) problem we are given a graph G ¼ ðV; EÞ, and an edge set property P, and asked whether G can be decomposed into two graphs, H and its complement H, for some graph H, in such a way that the edge cut-set (of the cut) ½VðHÞ; VðHÞ satisfies property P. Such a problem is motivated by the fact that several parameterized problems are trivially fixed-parameter tractable when the input graph G is decomposable into two complementary subgraphs. In addition, it generalizes the recognition of complementary prism graphs, and it is related to graph isomorphism when the desired cut-set is empty, COMP-SUB(;). In this paper we are particularly interested in the case COMP-SUB(;), where the decomposition also partitions the set of edges of G into E(H) and EðHÞ. When the input is a chordal graph, we show that COMP-SUB(;) is GI-complete, that is, polynomially equivalent to GRAPH ISOMORPHISM. But it becomes more tractable than GRAPH ISOMORPHISM for several subclasses of chordal graphs. We present structural characterizations for split, starlike, block, and unit interval graphs. We also obtain complexity results for permutation graphs, cographs, comparability graphs, co-comparability graphs, interval graphs, co-interval graphs and strongly chordal graphs. Furthermore, we present some remarks when P is a general edge set property and the case when the cut-set M induces a complete bipartite graph.

View PDFchevron_right
580 California St., Suite 400
San Francisco, CA, 94104
© 2025 Academia. All rights reserved