Pages that link to "Item:Q3058698"
From MaRDI portal
The following pages link to Are There Any Good Digraph Width Measures? (Q3058698):
Displaying 15 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- On the monotonicity of process number (Q299059) (← links)
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking (Q395003) (← links)
- Approximation algorithms for digraph width parameters (Q476883) (← links)
- Digraph decompositions and monotonicity in digraph searching (Q638540) (← links)
- Directed elimination games (Q896668) (← links)
- Directed NLC-width (Q906393) (← links)
- An extended tree-width notion for directed graphs related to the computation of permanents (Q2254501) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- The rank-width of edge-coloured graphs (Q2392245) (← links)
- Digraphs of bounded elimination width (Q2442210) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- DAG-Width and Circumference of Digraphs (Q2811203) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- (Q5743498) (← links)
