Publication:5743498
From MaRDI portal
zbMath1423.68353MaRDI QIDQ5743498
Stephan Kreutzer, Siamak Tazari
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095239
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C20: Directed graphs (digraphs), tournaments
05C42: Density (toughness, etc.)
Related Items
Unnamed Item, New Results on Directed Edge Dominating Set, On Directed Covering and Domination Problems, Cut-sufficient directed 2-commodity multiflow topologies, Are there any good digraph width measures?, Directed elimination games, On directed covering and domination problems, Tournament minors, Tournaments and Semicomplete Digraphs, Digraphs of Bounded Width
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Digraph measures: Kelly decompositions, games, and orderings
- On complexity of minimum leaf out-branching problem
- Homomorphism preservation on quasi-wide classes
- A partial k-arboretum of graphs with bounded treewidth
- Directed tree-width
- The Turing way to parameterized complexity
- Grad and classes with bounded expansion. I: Decompositions
- On nowhere dense graphs
- Parametrized complexity theory.
- Directed path-width and monotonicity in digraph searching
- Domination Problems in Nowhere-Dense Classes
- Are There Any Good Digraph Width Measures?
- DAG-width
- On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures
- On Digraph Width Measures in Parameterized Algorithmics
- First order properties on nowhere dense structures
- Digraph Decompositions and Monotonicity in Digraph Searching
- DAG-Width and Parity Games
- Mathematical Foundations of Computer Science 2005
- SOFSEM 2005: Theory and Practice of Computer Science
- Directed Rank-Width and Displit Decomposition
- Parameterized Complexity of Arc-Weighted Directed Steiner Problems
