Digraph measures: Kelly decompositions, games, and orderings
From MaRDI portal
(Redirected from Publication:930893)
Recommendations
Cites work
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- scientific article; zbMATH DE number 1361465 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- Algorithmic Aspects of Vertex Elimination on Directed Graphs
- Algorithms – ESA 2005
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Approximating clique-width and branch-width
- Approximation algorithms for NP-complete problems on planar graphs
- Automata, logics, and infinite games. A guide to current research
- DAG-Width and Parity Games
- DAG-width
- Digraph Decompositions and Monotonicity in Digraph Searching
- Digraph measures: Kelly decompositions, games, and orderings
- Directed path-width and monotonicity in digraph searching
- Directed tree-width
- Directed tree-width examples
- Elimination Structures for Unsymmetric Sparse $LU$ Factors
- Fugitive-search games on graphs and related parameters
- Graph searching, elimination trees, and a generalization of bandwidth
- Introducing directed tree width
- Mathematical Foundations of Computer Science 2005
- On Exact Algorithms for Treewidth
- Rank-width and vertex-minors
- Subgraph Isomorphism in Planar Graphs and Related Problems
- The Role of Elimination Trees in Sparse Factorization
- Triangulated graphs and the elimination process
- Upper bounds to the clique width of graphs
Cited in
(47)- Directed NLC-width
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- scientific article; zbMATH DE number 7559442 (Why is no real title available?)
- An algorithmic metatheorem for directed treewidth
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Computing the zig-zag number of directed graphs
- Are there any good digraph width measures?
- Directed path-decompositions
- The dag-width of directed graphs
- DAG-width and circumference of digraphs
- Digraph measures: Kelly decompositions, games, and orderings
- What's next? Future directions in parameterized complexity
- Parity games on undirected graphs
- Are there any good digraph width measures?
- Redicolouring digraphs: directed treewidth and cycle-degeneracy
- Twin-distance-hereditary digraphs
- Chordal digraphs
- On the hardness of finding near-optimal multicuts in directed acyclic graphs
- On the monotonicity of process number
- Directed width parameters and circumference of digraphs
- Entanglement and the complexity of directed graphs
- Spined categories: generalizing tree-width beyond graphs
- On width measures and topological problems on semi-complete digraphs
- Digraph coloring and distance to acyclicity
- Directed width parameters on semicomplete digraphs
- An extended tree-width notion for directed graphs related to the computation of permanents
- Algorithmic properties of sparse digraphs
- Well-quasi-ordering hereditarily finite sets
- Directed elimination games
- Digraph width measures in parameterized algorithmics
- On digraph width measures in parameterized algorithmics
- Approximation algorithms for digraph width parameters
- The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
- DAG-width is PSPACE-complete
- Jumping robbers in digraphs
- Complexity of semi-stable and stage semantics in argumentation frameworks
- Digraph decompositions and monotonicity in digraph searching
- Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth
- How to compute digraph width measures on directed co-graphs
- Parameterized Algorithms for Parity Games
- Forbidden directed minors and Kelly-width
- Directed nowhere dense classes of graphs
- The complexity of optimizing atomic congestion
- Digraphs of bounded width
- Recognizing digraphs of Kelly-width 2
- Characterization and Recognition of Digraphs of Bounded Kelly-width
- Digraphs of bounded elimination width
This page was built for publication: Digraph measures: Kelly decompositions, games, and orderings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930893)
