Pages that link to "Item:Q972341"
From MaRDI portal
The following pages link to \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341):
Displayed 10 items.
- Tree-representation of set families and applications to combinatorial decompositions (Q412262) (← links)
- Computing \(H\)-joins with application to 2-modular decomposition (Q486993) (← links)
- Boolean-width of graphs (Q719257) (← links)
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346) (← links)
- Automata for the verification of monadic second-order graph properties (Q1948277) (← links)
- The rank-width of edge-coloured graphs (Q2392245) (← links)
- Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760) (← links)
- Unifying the representation of symmetric crossing families and weakly partitive families (Q2851484) (← links)
- On the Boolean-Width of a Graph: Structure and Applications (Q3057622) (← links)
- Boolean-Width of Graphs (Q3656851) (← links)