Pages that link to "Item:Q1933649"
From MaRDI portal
The following pages link to A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width (Q1933649):
Displaying 13 items.
- Are there any good digraph width measures? (Q896003) (← links)
- Directed NLC-width (Q906393) (← links)
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width (Q1709594) (← links)
- On \textsf{NC} algorithms for problems on bounded rank-width graphs (Q1799577) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- Computing directed Steiner path covers (Q2125222) (← links)
- The rank-width of edge-coloured graphs (Q2392245) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- (Q4608071) (← links)
- Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. (Q5092404) (← links)
- On the complexity of finding large odd induced subgraphs and odd colorings (Q5918338) (← links)
- Computations by fly-automata beyond monadic second-order logic (Q5964015) (← links)