Pages that link to "Item:Q638540"
From MaRDI portal
The following pages link to Digraph decompositions and monotonicity in digraph searching (Q638540):
Displaying 10 items.
- On the monotonicity of process number (Q299059) (← links)
- The dag-width of directed graphs (Q444380) (← links)
- Directed elimination games (Q896668) (← links)
- The treewidth of proofs (Q2013559) (← links)
- Monotonicity of strong searching on digraphs (Q2426650) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Adapting the Directed Grid Theorem into an FPT Algorithm (Q5099098) (← links)
- Digraph Strong Searching: Monotonicity and Complexity (Q5434421) (← links)