Abstract
Boolean-width is a recently introduced graph invariant. Similar to tree-width, it measures the structural complexity of graphs. Given any graph G and a decomposition of G of boolean-width k, we give algorithms solving a large class of vertex subset and vertex partitioning problems in time \(O^*(2^{O(k^2)})\). We relate the boolean-width of a graph to its branch-width and to the boolean-width of its incidence graph. For this we use a constructive proof method that also allows much simpler proofs of similar results on rank-width in [S. Oum. Rank-width is less than or equal to branch-width. Journal of Graph Theory 57(3):239–244, 2008]. For an n-vertex random graph, with a uniform edge distribution, we show that almost surely its boolean-width is Θ(log2 n) – setting boolean-width apart from other graph invariants – and it is easy to find a decomposition witnessing this. Combining our results gives algorithms that on input a random graph on n vertices will solve a large class of vertex subset and vertex partitioning problems in quasi-polynomial time \(O^*(2^{O(\log ^4 n)})\).
Supported by the Norwegian Research Council, projects PARALGO and Graph Searching.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bodlaender, H., Koster, A.: Treewidth Computations I Upper Bounds. Technical Report UU-CS-2008-032, Department of Information and Computing Sciences, Utrecht University (2008)
Bui-Xuan, B.-M., Telle, J.A., Vatshelle, M.: Boolean-width of graphs. In: 4th International Workshop on Parameterized and Exact Computation (IWPEC 2009). LNCS, vol. 5917, pp. 61–74. Springer, Heidelberg (2009)
Bui-Xuan, B.-M., Telle, J.A., Vatshelle, M.: H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Discrete Applied Mathematics 158(7), 809–819 (2010)
Corneil, D., Rotics, U.: On the relationship between clique-width and treewidth. SIAM Journal on Computing 34(4), 825–847 (2005)
Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pp. 193–242 (1990)
Dorn, F.: Dynamic programming and fast matrix multiplication. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 280–291. Springer, Heidelberg (2006)
Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
Ganian, R., Hliněný, P.: On Parse Trees and Myhill-Nerode-type Tools for handling Graphs of Bounded Rank-width. Discrete Applied Mathematics 158(7), 851–867 (2010)
Gerber, M., Kobler, D.: Algorithms for vertex-partitioning problems on graphs with fixed clique-width. Theoretical Computer Science 299(1-3), 719–734 (2003)
Hliněný, P., Oum, S., Seese, D., Gottlob, G.: Width parameters beyond tree-width and their applications. The Computer Journal 51(3), 326–362 (2008)
Hvidevold, E.: Implementation of heuristics for computing boolean-width, Master thesis, University of Bergen (September 2010) (to appear)
Johansson, Ö.: Clique-decomposition, NLC-decomposition and modular decomposition – Relatiohships and results for random graphs. Congressus Numerantium 132, 39–60 (1998)
Kanté, M.: Vertex-minor reductions can simulate edge contractions. Discrete Applied Mathematics 155(17), 2328–2340 (2007)
Kim, K.H.: Boolean matrix theory and applications. Marcel Dekker, New York (1982)
Kloks, T., Bodlaender, H.: Only few graphs have bounded treewidth. Technical Report UU-CS-92-35, Department of Information and Computing Sciences, Utrecht University (1992)
Kobler, D., Rotics, U.: Edge dominating set and colorings on graphs with fixed clique-width. Discrete Applied Mathematics 126(2-3), 197–221 (2003); Abstract at SODA 2001
Lee, C., Lee, J., Oum, S.: Rank-width of Random Graphs, http://arxiv.org/pdf/1001.0461
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
Oum, S.: Rank-width is less than or equal to branch-width. Journal of Graph Theory 57(3), 239–244 (2008)
Rabinovich, Y., Telle, J.A.: On the boolean-width of a graph: structure and applications, http://arxiv.org/pdf/0908.2765
Rooij, J., Bodlaender, H., Rossmanith, P.: Dynamic programming on tree decompositions using generalised fast subset convolution. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 566–577. Springer, Heidelberg (2009)
Telle, J.A., Proskurowski, A.: Algorithms for vertex partitioning problems on partial k-trees. SIAM Journal on Discrete Mathematics 10(4), 529–550 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Adler, I., Bui-Xuan, BM., Rabinovich, Y., Renault, G., Telle, J.A., Vatshelle, M. (2010). On the Boolean-Width of a Graph: Structure and Applications. In: Thilikos, D.M. (eds) Graph Theoretic Concepts in Computer Science. WG 2010. Lecture Notes in Computer Science, vol 6410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16926-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-16926-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16925-0
Online ISBN: 978-3-642-16926-7
eBook Packages: Computer ScienceComputer Science (R0)