Pages that link to "Item:Q2502026"
From MaRDI portal
The following pages link to Directed path-width and monotonicity in digraph searching (Q2502026):
Displaying 45 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- On the monotonicity of process number (Q299059) (← links)
- Computing directed pathwidth in \(O(1.89^n)\) time (Q300464) (← links)
- Jumping robbers in digraphs (Q343927) (← links)
- DAG-width is PSPACE-complete (Q343929) (← links)
- The dag-width of directed graphs (Q444380) (← links)
- On the algorithmic effectiveness of digraph decompositions and complexity measures (Q456704) (← links)
- Approximation algorithms for digraph width parameters (Q476883) (← links)
- Computing the pathwidth of directed graphs with small vertex cover (Q477674) (← links)
- Forbidden directed minors and Kelly-width (Q501668) (← links)
- A cops and robber game in multidimensional grids (Q602750) (← 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)
- Are there any good digraph width measures? (Q896003) (← links)
- Directed elimination games (Q896668) (← links)
- Monotonicity of non-deterministic graph searching (Q930888) (← 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)
- Monotonicity in digraph search problems (Q955030) (← links)
- On complexity of minimum leaf out-branching problem (Q967352) (← links)
- Standard directed search strategies and their applications (Q1029267) (← links)
- Towards fixed-parameter tractable algorithms for abstract argumentation (Q1761281) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- Using decomposition-parameters for QBF: mind the prefix! (Q2304627) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Monotonicity of strong searching on digraphs (Q2426650) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- A Slice Theoretic Approach for Embedding Problems on Digraphs (Q2827823) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← 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)
- Scanning Phylogenetic Networks Is NP-hard (Q3297781) (← links)
- Monotonicity of Non-deterministic Graph Searching (Q3508552) (← links)
- On Digraph Width Measures in Parameterized Algorithmics (Q3656861) (← links)
- (Q5089244) (← links)
- (Q5090497) (← links)
- Directed Path-Decompositions (Q5215903) (← links)
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
- Digraph Decompositions and Monotonicity in Digraph Searching (Q5302067) (← links)
- (Q5743498) (← links)
- Characterizations and directed path-width of sequence digraphs (Q6038712) (← links)
- A cops and robber game and the meeting time of synchronous directed walks (Q6599064) (← links)
