Pages that link to "Item:Q5302067"
From MaRDI portal
The following pages link to Digraph Decompositions and Monotonicity in Digraph Searching (Q5302067):
Displaying 13 items.
- On the monotonicity of process number (Q299059) (← links)
- The dag-width of directed graphs (Q444380) (← links)
- On the algorithmic effectiveness of digraph decompositions and complexity measures (Q456704) (← 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)
- Digraph measures: Kelly decompositions, games, and orderings (Q930893) (← links)
- On complexity of minimum leaf out-branching problem (Q967352) (← links)
- Entanglement and the complexity of directed graphs (Q1929212) (← links)
- Digraphs of bounded elimination width (Q2442210) (← links)
- LIFO-Search on Digraphs: A Searching Game for Cycle-Rank (Q3088285) (← links)
- Tree-Width for First Order Formulae (Q3644741) (← links)
- On Digraph Width Measures in Parameterized Algorithmics (Q3656861) (← links)
- (Q5743498) (← links)
