Pages that link to "Item:Q3656861"
From MaRDI portal
The following pages link to On Digraph Width Measures in Parameterized Algorithmics (Q3656861):
Displaying 17 items.
- On the algorithmic effectiveness of digraph decompositions and complexity measures (Q456704) (← links)
- Approximation algorithms for digraph width parameters (Q476883) (← links)
- Digraph decompositions and monotonicity in digraph searching (Q638540) (← links)
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth (Q713301) (← links)
- Computing the zig-zag number of directed graphs (Q831867) (← links)
- Directed elimination games (Q896668) (← links)
- Hypertree-depth and minors in hypergraphs (Q1929221) (← links)
- The treewidth of proofs (Q2013559) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- The rank-width of edge-coloured graphs (Q2392245) (← links)
- A Slice Theoretic Approach for Embedding Problems on Digraphs (Q2827823) (← links)
- Are There Any Good Digraph Width Measures? (Q3058698) (← links)
- LIFO-Search on Digraphs: A Searching Game for Cycle-Rank (Q3088285) (← links)
- A Polynomial Time Algorithm for Bounded Directed Pathwidth (Q3104788) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- (Q5090497) (← links)
- (Q5743498) (← links)
