Pages that link to "Item:Q2954982"
From MaRDI portal
The following pages link to Graph searching games and width measures for directed graphs (Q2954982):
Displaying 11 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- DAG-width is PSPACE-complete (Q343929) (← links)
- The dag-width of directed graphs (Q444380) (← links)
- Directed width parameters on semicomplete digraphs (Q2150583) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- Static search games played over graphs and general metric spaces (Q2356189) (← links)
- Directed path-width and monotonicity in digraph searching (Q2502026) (← links)
- Directed tree-width examples (Q2642009) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- (Q5089244) (← links)
- Twin-distance-hereditary digraphs (Q6132965) (← links)