Digraph measures: Kelly decompositions, games, and orderings
From MaRDI portal
Publication:930893
DOI10.1016/J.TCS.2008.02.038zbMATH Open1152.91015OpenAlexW2090787331MaRDI QIDQ930893FDOQ930893
Publication date: 24 June 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:6dd728d5-d2f7-4911-9499-3e76990cff4b
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Directed tree-width
- Upper bounds to the clique width of graphs
- Approximating clique-width and branch-width
- Directed path-width and monotonicity in digraph searching
- Introducing directed tree width
- Approximation algorithms for NP-complete problems on planar graphs
- On Exact Algorithms for Treewidth
- Mathematical Foundations of Computer Science 2005
- Automata, logics, and infinite games. A guide to current research
- Triangulated graphs and the elimination process
- Rank-width and vertex-minors
- Fugitive-search games on graphs and related parameters
- Directed tree-width examples
- The Role of Elimination Trees in Sparse Factorization
- Digraph Decompositions and Monotonicity in Digraph Searching
- Algorithmic Aspects of Vertex Elimination on Directed Graphs
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- DAG-Width and Parity Games
- DAG-width
- Graph searching, elimination trees, and a generalization of bandwidth
- Subgraph Isomorphism in Planar Graphs and Related Problems
- Algorithms – ESA 2005
- Elimination Structures for Unsymmetric Sparse $LU$ Factors
Cited In (45)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- Directed NLC-width
- Title not available (Why is that?)
- Towards fixed-parameter tractable algorithms for abstract argumentation
- An algorithmic metatheorem for directed treewidth
- Computing the zig-zag number of directed graphs
- What’s Next? Future Directions in Parameterized Complexity
- Are there any good digraph width measures?
- DAG-width and circumference of digraphs
- The dag-width of directed graphs
- Title not available (Why is that?)
- Digraphs of Bounded Width
- Parity games on undirected graphs
- 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
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth
- Directed width parameters and circumference of digraphs
- Spined categories: generalizing tree-width beyond graphs
- Title not available (Why is that?)
- Entanglement and the complexity of directed graphs
- Digraph coloring and distance to acyclicity
- On width measures and topological problems on semi-complete digraphs
- Directed width parameters on semicomplete digraphs
- An extended tree-width notion for directed graphs related to the computation of permanents
- Well-quasi-ordering hereditarily finite sets
- Digraph width measures in parameterized algorithmics
- Directed elimination games
- Approximation algorithms for digraph width parameters
- The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
- Complexity of semi-stable and stage semantics in argumentation frameworks
- DAG-width is PSPACE-complete
- Jumping robbers in digraphs
- Digraph decompositions and monotonicity in digraph searching
- Are There Any Good Digraph Width Measures?
- How to compute digraph width measures on directed co-graphs
- Directed Path-Decompositions
- Parameterized Algorithms for Parity Games
- Forbidden directed minors and Kelly-width
- The complexity of optimizing atomic congestion
- Recognizing digraphs of Kelly-width 2
- Digraphs of bounded elimination width
- On Digraph Width Measures in Parameterized Algorithmics
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)
