Boolean-width of graphs

Abstract We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods–Boolean sums of neighborhoods–across a cut of a graph. For many graph problems, this number is the runtime bottleneck when using a divide-and-conquer approach. For an n -vertex graph given with a decomposition tree of boolean-width k , we solve Maximum Weight Independent Set in time O ( n 2 k 2 2 k ) and Minimum Weight Dominating Set in time O ( n 2 + n k 2 3 k ) . With an additional n 2 factor in the runtime, we can also count all independent sets and dominating sets of each cardinality. Boolean-width is bounded on the same classes of graphs as clique-width. boolean-width is similar to rank-width, which is related to the number of G F ( 2 ) -sums of neighborhoods instead of the Boolean sums used for boolean-width. We show for any graph that its boolean-width is at most its clique-width and at most quadratic in its rank-width. We exhibit a class of graphs, the Hsu-grids, having the property that a Hsu-grid on Θ ( n 2 ) vertices has boolean-width Θ ( log n ) and rank-width, clique-width, tree-width, and branch-width Θ ( n ) .

[1]  Jan Arne Telle,et al.  Finding Good Decompositions for Dynamic Programming on Dense Graphs , 2011, IPEC.

[2]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[3]  Paul D. Seymour,et al.  Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.

[4]  Paul D. Seymour,et al.  Approximating clique-width and branch-width , 2006, J. Comb. Theory, Ser. B.

[5]  Gian-Carlo Rota,et al.  THE NUMBER OF SUBSPACES OF A VECTOR SPACE. , 1969 .

[6]  Bruno Courcelle,et al.  Handle-Rewriting Hypergraph Grammars , 1993, J. Comput. Syst. Sci..

[7]  Jan Arne Telle,et al.  H-join decomposable graphs and algorithms with runtime single exponential in rankwidth , 2010, Discret. Appl. Math..

[8]  Hans L. Bodlaender,et al.  Only few graphs have bounded treewidth , 1992 .

[9]  N. Alon,et al.  Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2004 .

[10]  Petr Hlinený,et al.  Finding Branch-Decompositions and Rank-Decompositions , 2007, SIAM J. Comput..

[11]  Arie M. C. A. Koster,et al.  Treewidth computations I. Upper bounds , 2010, Inf. Comput..

[12]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[13]  J. A. Telle,et al.  Fast algorithms for vertex subset and vertex partitioning problems on graphs of low boolean-width ⋆ , 2009 .

[14]  Frederic Dorn,et al.  Dynamic Programming and Fast Matrix Multiplication , 2006, ESA.

[15]  Laurent Viennot,et al.  Partition Refinement Techniques: An Interesting Algorithmic Tool Kit , 1999, Int. J. Found. Comput. Sci..

[16]  Ronald L. Breiger,et al.  Lattices and dimensional representations: matrix decompositions and ordering structures , 2002, Soc. Networks.

[17]  Udi Rotics,et al.  On the Clique-Width of Some Perfect Graph Classes , 2000, Int. J. Found. Comput. Sci..

[18]  Miodrag Zivkovic.  Row Space Cardinalities , 2006 .

[19]  Martin Vatshelle,et al.  Graph Classes with Structured Neighborhoods and Algorithmic Applications , 2011, WG.

[20]  Michaël Rao,et al.  Clique-width of graphs defined by one-vertex extensions , 2008, Discret. Math..

[21]  Jan Arne Telle,et al.  Feedback Vertex Set on Graphs of Low Cliquewidth , 2009, IWOCA.

[22]  B. Reed.  Surveys in Combinatorics, 1997: Tree Width and Tangles: A New Connectivity Measure and Some Applications , 1997 .

[23]  Anders Yeo,et al.  The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments , 2006, Combinatorics, Probability and Computing.

[24]  Ki Hang Kim,et al.  On Covering and Rank Problems for Boolean Matrices and Their Applications , 1999, COCOON.

[25]  Patrick Thiran,et al.  Active Measurement for Multiple Link Failures Diagnosis in IP Networks , 2004, PAM.

[26]  Bruno Courcelle,et al.  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width , 2000, Theory of Computing Systems.

[27]  Bert Gerards,et al.  Branch-Width and Well-Quasi-Ordering in Matroids and Graphs , 2002, J. Comb. Theory, Ser. B.

[28]  Jan Arne Telle,et al.  Algorithms for Vertex Partitioning Problems on Partial k-Trees , 1997, SIAM J. Discret. Math..

[29]  Sang-il Oum,et al.  Rank‐width of random graphs , 2010, J. Graph Theory.

[30]  Udi Rotics,et al.  Edge dominating set and colorings on graphs with fixed clique-width , 2003, Discret. Appl. Math..

[31]  Georg Gottlob,et al.  Width Parameters Beyond Tree-width and their Applications , 2008, Comput. J..

[32]  Vít Jelínek.  The Rank-Width of the Square Grid , 2008, WG.

[33]  Sang-il Oum,et al.  Rank‐width is less than or equal to branch‐width , 2008, J. Graph Theory.

[34]  Wen-Lian Hsu.  Decomposition of perfect graphs , 1987, J. Comb. Theory, Ser. B.

[35]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[36]  Michaël Rao.  Décompositions de graphes et algorithmes efficaces , 2006 .

[37]  Peter Rossmanith,et al.  Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution , 2009, ESA.

[38]  Gabriel Renault,et al.  On the Boolean-Width of a Graph: Structure and Applications , 2009, WG.

[39]  Martin Vatshelle,et al.  Graph classes with structured neighborhoods and algorithmic applications , 2011, Theor. Comput. Sci..

[40]  Vadim V. Lozin,et al.  On the linear structure and clique-width of bipartite permutation graphs , 2003, Ars Comb..

[41]  P. Seymour,et al.  Graphs of bounded rank-width , 2005 .

[42]  Eyal Amir,et al.  Approximation Algorithms for Treewidth , 2010, Algorithmica.

[43]  Udi Rotics,et al.  On the Relationship between Clique-Width and Treewidth , 2001, WG.

[44]  Robert Ganian,et al.  On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width , 2010, Discret. Appl. Math..