NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs (Q5891702)
From MaRDI portal
(Redirected from Item:Q5899483)
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs |
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
0.9999999
0 references
0.8887039
0 references
0.87783515
0 references
0.8746882
0 references
0.8746882
0 references
0.86845183
0 references
0.8656466
0 references
0.86564654
0 references