Graph minors. V. Excluding a planar graph
Journal of Combinatorial Theory Series B
k-NLC graphs and polynomial algorithms
Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
SIAM Journal on Computing
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
NC-Algorithms for Graphs with Small Treewidth
WG '88 Proceedings of the 14th International Workshop on Graph-Theoretic Concepts in Computer Science
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
The recognizability of sets of graphs is a robust property
Theoretical Computer Science
Approximating clique-width and branch-width
Journal of Combinatorial Theory Series B
Vertex-minor reductions can simulate edge contractions
Discrete Applied Mathematics
Query efficient implementation of graphs of bounded clique-width
Discrete Applied Mathematics
Recognizability, hypergraph operations, and logical types
Information and Computation
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Finding branch-decompositions and rank-decompositions
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Approximating rank-width and clique-width quickly
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Parameterized Complexity
Graph operations characterizing rank-width
Discrete Applied Mathematics
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Discrete Applied Mathematics
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
| Hi-index | 0.00 |
Graph complexity measures like tree-width, clique-width, NLC-width and rank-width are important because they yield Fixed Parameter Tractable algorithms. Rank-width is based on ranks of adjacency matrices of graphs over GF(2). We propose here algebraic operations on graphs that characterize rank-width. For algorithmic purposes, it is important to represent graphs by balanced terms. We give a unique theorem that generalizes several "balancing theorems" for tree-width and clique-width. New results are obtained for rank-width and a variant of clique-width, called m-clique-width.