Pages that link to "Item:Q266806"
From MaRDI portal
The following pages link to An algorithmic metatheorem for directed treewidth (Q266806):
Displaying 5 items.
- Computing the zig-zag number of directed graphs (Q831867) (← links)
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Adapting the Directed Grid Theorem into an FPT Algorithm (Q5099098) (← links)
- Directed Path-Decompositions (Q5215903) (← links)