The following pages link to (Q2934648):
Displaying 12 items.
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- On the algorithmic effectiveness of digraph decompositions and complexity measures (Q456704) (← links)
- Digraph measures: Kelly decompositions, games, and orderings (Q930893) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Digraph searching, directed vertex separation and directed pathwidth (Q944735) (← links)
- On complexity of minimum leaf out-branching problem (Q967352) (← links)
- Entanglement and the complexity of directed graphs (Q1929212) (← links)
- A Polynomial Time Algorithm for Bounded Directed Pathwidth (Q3104788) (← links)
- Graph Searching in a Crime Wave (Q3508551) (← links)
- Characterization and Recognition of Digraphs of Bounded Kelly-width (Q3508574) (← links)
- Digraph Decompositions and Monotonicity in Digraph Searching (Q5302067) (← links)
- The Complexity of Nash Equilibria in Infinite Multiplayer Games (Q5458348) (← links)
