Directed width parameters on semicomplete digraphs
From MaRDI portal
Publication:2150583
DOI10.1007/978-3-030-92681-6_48OpenAlexW4206381755MaRDI QIDQ2150583
Carolin Rehs, Sebastian Wiederrecht, Frank Gurski, Dominique Komander
Publication date: 29 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_48
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Unnamed Item
- DAG-width is PSPACE-complete
- The dag-width of directed graphs
- A well-quasi-order for tournaments
- Tournament pathwidth and topological containment
- Are there any good digraph width measures?
- Directed NLC-width
- Digraph measures: Kelly decompositions, games, and orderings
- Directed tree-width
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Adapting the directed grid theorem into an \textsf{FPT} algorithm
- How to compute digraph width measures on directed co-graphs
- On width measures and topological problems on semi-complete digraphs
- Comparing linear width parameters for directed graphs
- Tournament minors
- Digraph width measures in parameterized algorithmics
- Approximating clique-width and branch-width
- On the relationship between NLC-width and linear NLC-width
- Graph minors. II. Algorithmic aspects of tree-width
- Classes of Directed Graphs
- DAG-Width and Parity Games
