Journal of Combinatorial Theory Series B
The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Graph minors: X. obstructions to tree-decomposition
Journal of Combinatorial Theory Series B
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Edge dominating set and colorings on graphs with fixed clique-width
Discrete Applied Mathematics
Problems Easy for Tree-Decomposable Graphs (Extended Abstract)
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
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
Journal of Combinatorial Theory Series B
Approximating clique-width and branch-width
Journal of Combinatorial Theory Series B
Branch-width, parse trees, and monadic second-order logic for matroids
Journal of Combinatorial Theory Series B
MSOL partitioning problems on graphs of bounded treewidth and clique-width
Theoretical Computer Science
Finding Branch-Decompositions and Rank-Decompositions
SIAM Journal on Computing
Graph operations characterizing rank-width
Discrete Applied Mathematics
Better Polynomial Algorithms on Graphs of Bounded Rank-Width
Combinatorial Algorithms
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
Discrete Applied Mathematics
Graph operations characterizing rank-width and balanced graph expressions
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
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
New results on the complexity of the max- and min-rep problems
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Thread Graphs, Linear Rank-Width and Their Algorithmic Applications
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Linear-time algorithms for graphs of bounded rankwidt: a fresh look using game theory
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Twin-Cover: beyond vertex cover in parameterized algorithmics
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
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
Digraph width measures in parameterized algorithmics
Discrete Applied Mathematics
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
| Hi-index | 0.04 |
Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework and tools for easy design of dynamic algorithms running directly on a rank-decomposition of a graph (on contrary to the usual approach which translates a rank-decomposition into a clique-width expression, with a possible exponential jump in the parameter). The main advantage of this framework is a fine control over the runtime dependency on the rank-width parameter. Our new approach is linked to a work of Courcelle and Kante [7] who first proposed algebraic expressions with a so-called bilinear graph product as a better way of handling rank-decompositions, and to a parallel recent research of Bui-Xuan, Telle and Vatshelle.