On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width

@article{Ganian2010OnPT,
  title={On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width},
  author={Robert Ganian and Petr Hlinen{\'y}},
  journal={Discrete Applied Mathematics},
  year={2010},
  volume={158},
  pages={851-867}
}
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 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 rankdecomposition into a clique-width expression, with a possible exponential jump in the parameter). Our new approach links to a previous work of Courcelle and Kanté [WG 2007] who… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 38 extracted citations

Fast algorithms for decomposable graphs

View 20 Excerpts
Highly Influenced

The Multivariate Algorithmic Revolution and Beyond

Lecture Notes in Computer Science • 2012
View 8 Excerpts
Highly Influenced

The Rank-Width of Edge-Coloured Graphs

Theory of Computing Systems • 2012
View 4 Excerpts
Highly Influenced

On the Complexity of Rainbow Coloring Problems

Discrete Applied Mathematics • 2018
View 1 Excerpt

Transforming graph states using single-qubit operations

Philosophical transactions. Series A, Mathematical, physical, and engineering sciences • 2018

References

Publications referenced by this paper.
Showing 1-10 of 25 references

Edge dominating set and colorings on graphs with fixed clique-width

Discrete Applied Mathematics • 2003
View 10 Excerpts
Highly Influenced

Automata formalization for graphs of bounded rank-width

R. Ganian
Master thesis. Faculty of Informatics of the Masaryk University, Brno, Czech republic • 2008
View 3 Excerpts
Highly Influenced

Approximating clique-width and branch-width

J. Comb. Theory, Ser. B • 2006
View 5 Excerpts
Highly Influenced

Rank-width and vertex-minors

J. Comb. Theory, Ser. B • 2005
View 4 Excerpts
Highly Influenced

Finite automata, bounded treewidth, and well-quasiordering

Graph Structure Theory • 1991
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…