Decomposition of perfect graphs
Journal of Combinatorial Theory Series B
Three partition refinement algorithms
SIAM Journal on Computing
Graph minors: X. obstructions to tree-decomposition
Journal of Combinatorial Theory Series B
Algorithms for Vertex Partitioning Problems on Partial k-Trees
SIAM Journal on Discrete Mathematics
Edge dominating set and colorings on graphs with fixed clique-width
Discrete Applied Mathematics
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Algorithms for vertex-partitioning problems on graphs with fixed clique-width
Theoretical Computer Science
On the Relationship Between Clique-Width and Treewidth
SIAM Journal on Computing
Graphs of bounded rank-width
Approximating clique-width and branch-width
Journal of Combinatorial Theory Series B
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
Combinatorics, Probability and Computing
Vertex-minors, monadic second-order logic, and a conjecture by Seese
Journal of Combinatorial Theory Series B
MSOL partitioning problems on graphs of bounded treewidth and clique-width
Theoretical Computer Science
Rank-width is less than or equal to branch-width
Journal of Graph Theory
Finding Branch-Decompositions and Rank-Decompositions
SIAM Journal on Computing
Clique-width: on the price of generality
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Graph operations characterizing rank-width
Discrete Applied Mathematics
Width Parameters Beyond Tree-width and their Applications
The Computer Journal
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Discrete Applied Mathematics
On the Boolean-width of a graph: structure and applications
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Tree-representation of set families and applications to combinatorial decompositions
European Journal of Combinatorics
Algorithms for some h-join decompositions
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Feedback vertex set on graphs of low clique-width
European Journal of Combinatorics
A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width
European Journal of Combinatorics
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
Hi-index | 0.04 |
We introduce H-join decompositions of graphs, indexed by a fixed bipartite graph H. These decompositions are based on a graph operation that we call a H-join, which adds edges between two given graphs by taking partitions of their two vertex sets, identifying the classes of the partitions with vertices of H, and connecting classes by the pattern H. H-join decompositions are related to modular, split and rank decompositions. Given an H-join decomposition of an n-vertex m-edge graph G, we solve the Maximum Independent Set and Minimum Dominating Set problems on G in time O(n(m+2^O^(^@r^(^H^)^^^2^))), and the q-Coloring problem in time O(n(m+2^O^(^q^@r^(^H^)^^^2^))), where @r(H) is the rank of the adjacency matrix of H over GF(2). Rankwidth is a graph parameter introduced by Oum and Seymour, based on ranks of adjacency matrices over GF(2). For any positive integer k we define a bipartite graph R"k and show that the graphs of rankwidth at most k are exactly the graphs having an R"k-join decomposition, thereby giving an alternative graph-theoretic definition of rankwidth that does not use linear algebra. Combining our results we get algorithms that, for a graph G of rankwidth k given with its width k rank-decomposition, solves the Maximum Independent Set problem in time O(n(m+2^1^2^k^^^2^+^9^2^kxk^2)), the Minimum Dominating Set problem in time O(n(m+2^3^4^k^^^2^+^2^3^4^kxk^3)) and the q-Coloring problem in time O(n(m+2^q^2^k^^^2^+^5^q^+^4^2^kxk^2^qxq)). These are the first algorithms for NP-hard problems whose runtimes are single exponential in the rankwidth.