Automata approach to graphs of bounded rank-width
From MaRDI portal
Recommendations
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
- Linear-time algorithms for graphs of bounded rankwidth: a fresh look using game theory (extended abstract)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- Graph operations characterizing rank-width
- Rank-width: algorithmic and structural results
Cited in
(5)- Linear-time algorithms for graphs of bounded rankwidth: a fresh look using game theory (extended abstract)
- On digraph width measures in parameterized algorithmics
- Rank and statistical mapping of a strongly connected automaton
- Computations by fly-automata beyond monadic second-order logic
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
This page was built for publication: Automata approach to graphs of bounded rank-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104253)
