Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
Graph searching and a min-max theorem for tree-width
Journal of Combinatorial Theory Series B
Complexity of path-forming games
Theoretical Computer Science
Journal of Combinatorial Theory Series B
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Digraph measures: Kelly decompositions, games, and orderings
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
Monotonicity of non-deterministic graph searching
Theoretical Computer Science
Digraph measures: Kelly decompositions, games, and orderings
Theoretical Computer Science
Digraph searching, directed vertex separation and directed pathwidth
Discrete Applied Mathematics
Finite Automata, Digraph Connectivity, and Regular Expression Size
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
The Descriptive Complexity of Parity Games
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Digraph Decompositions and Monotonicity in Digraph Searching
Graph-Theoretic Concepts in Computer Science
Communication: On complexity of Minimum Leaf Out-Branching problem
Discrete Applied Mathematics
Bounded treewidth as a key to tractability of knowledge representation and reasoning
Artificial Intelligence
New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Tractable database design and datalog abduction through bounded treewidth
Information Systems
Recognizing digraphs of Kelly-width 2
Discrete Applied Mathematics
Monotonicity of non-deterministic graph searching
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Characterization and recognition of digraphs of bounded Kelly-width
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Arc searching digraphs without jumping
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Directed graphs of entanglement two
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
The complexity of Nash equilibria in infinite multiplayer games
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Pure Nash equilibria: complete characterization of hard and easy graphical games
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Parity games with partial information played on graphs of bounded complexity
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Digraph decompositions and monotonicity in digraph searching
Theoretical Computer Science
LIFO-search on digraphs: a searching game for cycle-rank
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Directed nowhere dense classes of graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A discourse on complexity of process models
BPM'06 Proceedings of the 2006 international conference on Business Process Management Workshops
A polynomial time algorithm for bounded directed pathwidth
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
The dag-width of directed graphs
Journal of Combinatorial Theory Series B
On the algorithmic effectiveness of digraph decompositions and complexity measures
Discrete Optimization
LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth
Discrete Applied Mathematics
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
The power of counting logics on restricted classes of finite structures
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Entanglement and the complexity of directed graphs
Theoretical Computer Science
Digraphs of bounded elimination width
Discrete Applied Mathematics
| Hi-index | 0.00 |
Tree-width is a very useful connectivity measure for undirected graphs. We propose a new definition, called DAG-width, for directed graphs which measures how close a graph is to a directed acyclic graph. In addition we define a cops-and-robber game and show that this game characterises exactly the class of graphs of bounded DAG-width. A comparison of DAG-width with tree-width and directed tree-width follows. Finally we show that NP-complete problems can be solved in polynomial time on graphs of bounded DAG-width.