Recommendations
- Domination problems in nowhere-dense classes of graphs
- Structural properties and constant factor-approximation of strong distance-r dominating sets in sparse directed graphs
- Polynomial kernels and wideness properties of nowhere dense graph classes
- Polynomial kernels and wideness properties of nowhere dense graph classes
- Digraph width measures in parameterized algorithmics
Cites work
- A partial k-arboretum of graphs with bounded treewidth
- Are there any good digraph width measures?
- DAG-width
- DAG-Width and Parity Games
- Digraph Decompositions and Monotonicity in Digraph Searching
- Digraph measures: Kelly decompositions, games, and orderings
- Directed path-width and monotonicity in digraph searching
- Directed rank-width and displit decomposition
- Directed tree-width
- Domination problems in nowhere-dense classes of graphs
- First order properties on nowhere dense structures
- Grad and classes with bounded expansion. I: Decompositions
- Homomorphism preservation on quasi-wide classes
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (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?)
- Introducing directed tree width
- Mathematical Foundations of Computer Science 2005
- On complexity of minimum leaf out-branching problem
- On digraph width measures in parameterized algorithmics
- On nowhere dense graphs
- On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures
- Parameterized complexity of arc-weighted directed Steiner problems
- Parametrized complexity theory.
- SOFSEM 2005: Theory and Practice of Computer Science
- The Turing way to parameterized complexity
Cited in
(14)- On directed covering and domination problems
- Tournament minors
- Domination problems in nowhere-dense classes of graphs
- Tournaments and Semicomplete Digraphs
- Digraphs of bounded width
- Structural properties and constant factor-approximation of strong distance-r dominating sets in sparse directed graphs
- New results on directed edge dominating set
- Algorithmic properties of sparse digraphs
- On directed covering and domination problems
- Cut-sufficient directed 2-commodity multiflow topologies
- Classes of intersection digraphs with good algorithmic properties
- Cut-sufficient directed 2-commodity multiflow topologies
- Are there any good digraph width measures?
- Directed elimination games
This page was built for publication: Directed nowhere dense classes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743498)
