NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs (Q5891702)
From MaRDI portal
scientific article; zbMATH DE number 6502407
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs |
scientific article; zbMATH DE number 6502407 |
Statements
NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs (English)
0 references
14 August 2012
0 references
30 October 2015
0 references
graph realization problems
0 references
combinatorial algorithms
0 references
parameterized complexity
0 references
realizing topological orderings
0 references
structural parameterization
0 references
0 references
0 references
0 references
