Pages that link to "Item:Q930893"

The following pages link to Digraph measures: Kelly decompositions, games, and orderings (Q930893):

Displaying 42 items.

• An algorithmic metatheorem for directed treewidth (Q266806) (← links)
• On the monotonicity of process number (Q299059) (← links)
• Jumping robbers in digraphs (Q343927) (← links)
• DAG-width is PSPACE-complete (Q343929) (← links)
• The dag-width of directed graphs (Q444380) (← links)
• Parity games on undirected graphs (Q456183) (← links)
• Approximation algorithms for digraph width parameters (Q476883) (← links)
• The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs (Q477199) (← links)
• Forbidden directed minors and Kelly-width (Q501668) (← links)
• Digraph decompositions and monotonicity in digraph searching (Q638540) (← links)
• Complexity of semi-stable and stage semantics in argumentation frameworks (Q656597) (← links)
• On the hardness of finding near-optimal multicuts in directed acyclic graphs (Q719273) (← links)
• Directed width parameters and circumference of digraphs (Q730003) (← 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)
• Directed NLC-width (Q906393) (← links)
• Recognizing digraphs of Kelly-width 2 (Q972333) (← links)
• Towards fixed-parameter tractable algorithms for abstract argumentation (Q1761281) (← links)
• Entanglement and the complexity of directed graphs (Q1929212) (← links)
• Chordal digraphs (Q1929220) (← links)
• Directed width parameters on semicomplete digraphs (Q2150583) (← links)
• How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
• An extended tree-width notion for directed graphs related to the computation of permanents (Q2254501) (← links)
• Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
• On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
• Digraphs of bounded elimination width (Q2442210) (← links)
• Digraph width measures in parameterized algorithmics (Q2442211) (← links)
• DAG-Width and Circumference of Digraphs (Q2811203) (← links)
• Well-quasi-ordering hereditarily finite sets (Q2855754) (← links)
• What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
• Parameterized Algorithms for Parity Games (Q2946404) (← links)
• Are There Any Good Digraph Width Measures? (Q3058698) (← links)
• Digraphs of Bounded Width (Q3120441) (← 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)
• (Q5743498) (← links)
• Spined categories: generalizing tree-width beyond graphs (Q6056559) (← links)
• Twin-distance-hereditary digraphs (Q6132965) (← links)