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 5 items.
- Tree-representation of set families and applications to combinatorial decompositions (Q412262) (← links)
- Boolean-width of graphs (Q719257) (← links)
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346) (← links)
- On the Boolean-Width of a Graph: Structure and Applications (Q3057622) (← links)
- Boolean-Width of Graphs (Q3656851) (← links)