Faster algorithms on branch and clique decompositions

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

Volumn 6281 LNCS, Issue , 2010, Pages 174-185

  Bodlaender, Hans L ^a   Van Leeuwen, Erik Jan ^b   Van Rooij, Johan M M ^a   Vatshelle, Martin ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH DECOMPOSITION; BRANCHWIDTH; CLIQUE-DECOMPOSITION; CLIQUE-WIDTH; DOMINATION PROBLEM; DYNAMIC PROGRAMMING ALGORITHM; FAST MATRIX MULTIPLICATION; GRAPH DECOMPOSITIONS; MATRIX MULTIPLICATION ALGORITHM; MINIMUM DOMINATING SET; NATURAL LOWER BOUNDS; OPTIMIZATION PROBLEMS; PERFECT MATCHINGS; RUNNING TIME; TIME ALGORITHMS;

COMPUTER SCIENCE; DYNAMIC PROGRAMMING; OPTIMIZATION;

ALGORITHMS;

EID: 78349296013     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15155-2_17     Document Type: Conference Paper

References (16)

1. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets Möbius: Fast Subset Convolution. In: STOC 2007, pp. 67-74. ACM, New York (2007)
2. Bodlaender, H.L., van Antwerpen-de Fluiter, B.: Reduction algorithms for graphs of small treewidth. Inform. Comput. 167, 86-119 (2001)
3. Bui-Xuan, B.-M., Telle, J.A., Vatshelle, M.: Boolean-width of graphs. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 61-74. Springer, Heidelberg (2009)
4. Coppersmith, D.,Winograd, S.: Matrix Multiplication via Arithmetic Progressions. J. Symbolic Comput. 9, 251-280 (1990)
5. Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-rewriting hypergraph grammars. J. Comput. System. Sci. 46(2), 218-270 (1993)
6. Courcelle, B., Olariu, S.: Upper bounds on the clique-width of graphs. Discrete Appl. Math. 101, 77-114 (2000)
7. Dorn, F., Penninkx, E., Bodlaender, H.L., Fomin, F.V.: Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. In: Brodal, G.S., Leonardi,S. (eds.)ESA2005.LNCS,vol.3669,pp.95-106.Springer, Heidelberg(2005)
8. 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)
9. Fomin, F.V., Thilikos, D.M.: Dominating Sets in Planar Graphs: Branch-width and Exponential Speed-up. In: SODA 2003, pp. 386-397. ACM, New York (2003)
10. Fomin, F.V., Thilikos, D.M.: A simple and fast approach for solving problems on planar graphs. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 56-67. Springer, Heidelberg (2004)
11. Fürer, M.: Faster Integer Multiplication. In: STOC 2007, pp. 57-66. ACM, New York (2007)
12. Robertson, N., Seymour, P.D.: Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory B 52(2), 153-190 (1991)
13. Telle, J.A.: Complexity of Domination-Type Problems in Graphs. Nordic J. Comput. 1, 157-171 (1994)
14. Telle, J.A., Proskurowski, A.: Algorithms for Vertex Partitioning Problems on Partial k-Trees. SIAM J. Discrete Math. 10, 529-550 (1997)
15. Valiant, L.G.: The Complexity of Computing the Permanent. Theor. Comput. Sci. 8, 189-201 (1979)
16. van Rooij, J.M.M., Bodlaender, H.L., Rossmanith, P.: Dynamic Programming onTree Decompositions Using Generalised Fast Subset Convolution. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 566-577. Springer, Heidelberg (2009)