On the boolean-width of a graph: Structure and applications

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

Volumn 6410 LNCS, Issue , 2010, Pages 159-170

  Adler, Isolde ^a   Bui Xuan, Binh Minh ^a   Rabinovich, Yuri ^b   Renault, Gabriel ^a   Telle, Jan Arne ^a   Vatshelle, Martin ^a  

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRUCTIVE PROOF; EDGE DISTRIBUTION; GRAPH G; GRAPH INVARIANT; INCIDENCE GRAPHS; LARGE CLASS; PARTITIONING PROBLEM; QUASI-POLYNOMIAL TIME; RANDOM GRAPHS; RANK-WIDTH; STRUCTURAL COMPLEXITY; TREE-WIDTH;

ALGORITHMS; COMPUTER SCIENCE; DISTRIBUTED COMPUTER SYSTEMS; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

GRAPH THEORY;

EID: 78650182548     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16926-7_16     Document Type: Conference Paper

References (23)

1. Bodlaender, H., Koster, A.: Treewidth Computations I Upper Bounds. Technical Report UU-CS-2008-032, Department of Information and Computing Sciences, Utrecht University (2008)
2. 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)
3. 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)
4. Corneil, D., Rotics, U.: On the relationship between clique-width and treewidth. SIAM Journal on Computing 34(4), 825-847 (2005)
5. 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)
6. 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)
7. Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)
8. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
9. Ganian, R., Hliněný, P.: On Parse Trees andMyhill-Nerode-type Tools for handling Graphs of Bounded Rank-width. Discrete Applied Mathematics 158(7), 851-867 (2010)
10. Gerber, M., Kobler, D.: Algorithms for vertex-partitioning problems on graphs with fixed clique-width. Theoretical Computer Science 299(1-3), 719-734 (2003)
11. 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) (Pubitemid 351649936)
12. Hvidevold, E.: Implementation of heuristics for computing boolean-width, Master thesis, University of Bergen (September 2010) (to appear)
13. Johansson, Ö .: Clique-decomposition, NLC-decomposition and modular decomposition - Relatiohships and results for random graphs. Congressus Numerantium 132, 39-60 (1998)
14. Kanté, M.: Vertex-minor reductions can simulate edge contractions. Discrete Applied Mathematics 155(17), 2328-2340 (2007)
15. Kim, K.H.: Boolean matrix theory and applications. Marcel Dekker, New York (1982)
16. 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)
17. 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
18. Lee, C., Lee, J., Oum, S.: Rank-width of Random Graphs, http://arxiv.org/pdf/1001.0461
19. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
20. Oum, S.: Rank-width is less than or equal to branch-width. Journal of Graph Theory 57(3), 239-244 (2008)
21. Rabinovich, Y., Telle, J.A.: On the boolean-width of a graph: structure and applications, http://arxiv.org/pdf/0908.2765
22. 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)
23. Telle, J.A., Proskurowski, A.: Algorithms for vertex partitioning problems on partial k-trees. SIAM Journal on Discrete Mathematics 10(4), 529-550 (1997)