H-join decomposable graphs and algorithms with runtime single exponential in rankwidth

Discrete Applied Mathematics

Volumn 158, Issue 7, 2010, Pages 809-819

  Bui Xuan, Binh Minh ^a   Telle, Jan Arne ^a   Vatshelle, Martin ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

Algorithms; Graphs; Independent set; Parameterized; Rank width

Indexed keywords

ADJACENCY MATRICES; ALTERNATIVE GRAPHS; BIPARTITE GRAPHS; COLORING PROBLEMS; GRAPH G; GRAPH OPERATIONS; GRAPH PARAMETERS; INDEPENDENT SET; MAXIMUM INDEPENDENT SETS; MINIMUM DOMINATING SET; NP-HARD PROBLEM; PARAMETERIZED; POLYNOMIAL FUNCTIONS; POSITIVE INTEGERS; RANK-WIDTH; RUNTIMES; VERTEX SET;

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; SET THEORY;

ALGORITHMS;

EID: 77649271402     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2009.09.009     Document Type: Article

References (28)

1. Alon N., and Spencer J. The probabilistic method. Wiley-Interscience Series in Discrete Mathematics and Optimization (2000)
2. Charbit P., Thomassé S., and Yeo A. The minimum feedback arc set problem is NP-hard for tournaments. Combinatorics, Probability and Computing 16 1 (2007) 1-4
3. Chudnovsky M., Robertson N., Seymour P., and Thomas R. The strong perfect graph theorem. Annals of Mathematics 164 1 (2006) 51-229
4. Corneil D., and Rotics U. On the relationship between clique-width and treewidth. SIAM Journal on Computing 34 4 (2005) 825-847
5. Cornuéjols G., and Cunningham W. Compositions for perfect graphs. Discrete Mathematics 55 3 (1985) 245-254
6. Courcelle B., and Kanté M. Graph operations characterizing rank-width. Discrete Applied Mathematics 157 4 (2009) 627-640 Abstract at WG'07
7. Courcelle B., Makowsky J., and Rotics U. Linear time solvable optimization problems on graphs of bounded clique-width. Theory of Computing Systems 33 2 (2000) 125-150
8. Courcelle B., and Oum S. Vertex-minors, monadic second-order logic, and a conjecture by Seese. Journal of Combinatorial Theory, Series B 97 1 (2007) 91-126
9. Cunningham W., and Edmonds J. A combinatorial decomposition theory. Canadian Journal of Mathematics 32 (1980) 734-765
10. Downey R., and Fellows M. Parameterized Complexity (1999), Springer Verlag
11. Espelage W., Gurski F., and Wanke E. How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. 26th International Workshop on Graph-Theoretic Concepts in Computer Science. WG'01. LNCS vol. 2204 (2001) 117-128
12. F. Fomin, P. Golovach, D. Lokshtanov, S. Saurabh, Clique-width: On the price of generality, in: 20th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'2009, 2009, pp. 825-834
13. Frick M., and Grohe M. The complexity of first-order and monadic second-order logic revisited. Annals of Pure and Applied Logic 130 1-3 (2004) 3-31
14. Gallai T. Transitiv orientierbare Graphen. Acta Mathematica Academiae Scientiarum Hungaricae 18 (1967) 25-66
15. R. Ganian, P. Hliněný, On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. Abstract at IWOCA'08. (accepted for publication). http://www.fi.muni.cz/~hlineny/Research/papers/MNtools-2.pdf
16. Gerber M., and Kobler D. Algorithms for vertex-partitioning problems on graphs with fixed clique-width. Theoretical Computer Science 299 1-3 (2003) 719-734
17. Habib M., Paul C., and Viennot L. Partition refinement techniques: An interesting algorithmic tool kit. International Journal of Foundations of Computer Science 10 2 (1999) 147-170
18. Hliněný P., and Oum S. Finding branch-decompositions and rank-decompositions. SIAM Journal on Computing 38 3 (2008) 1012-1032 Abstract at ESA'07
19. Hliněný P., Oum S., Seese D., and Gottlob G. Width parameters beyond tree-width and their applications. The Computer Journal 51 3 (2008) 326-362
20. Hsu W.-L. Decomposition of perfect graphs. Journal of Combinatorial Theory, Series B 43 1 (1987) 70-94
21. Kobler D., and Rotics U. Edge dominating set and colorings on graphs with fixed clique-width. Discrete Applied Mathematics 126 2-3 (2003) 197-221 Abstract at SODA'01
22. S. Oum, Graphs of bounded rank-width, Ph.D. Thesis, Princeton University, 2005
23. Oum S. Rank-width is less than or equal to branch-width. Journal of Graph Theory 57 3 (2008) 239-244
24. Oum S., and Seymour P. Approximating clique-width and branch-width. Journal of Combinatorial Theory, Series B 96 4 (2006) 514-528
25. Paige R., and Tarjan R. Three partition refinement algorithms. SIAM Journal on Computing 16 6 (1987) 973-989
26. Rao M. MSOL partitioning problems on graphs of bounded treewidth and clique-width. Theoretical Computer Science 377 1-3 (2007) 260-267
27. Robertson N., and Seymour P. Graph minors. X. Obstructions to tree-decomposition. Journal of Combinatorial Theory, Series B 52 2 (1991) 153-190
28. Telle J.A., and Proskurowski A. Algorithms for vertex partitioning problems on partial k-trees. SIAM Journal on Discrete Mathematics 10 4 (1997) 529-550