Multigraph realizations of degree sequences: Maximization is easy, minimization is hard (Q957360)
From MaRDI portal
 | 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: Multigraph realizations of degree sequences: Maximization is easy, minimization is hard |
scientific article; zbMATH DE number 5374656
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multigraph realizations of degree sequences: Maximization is easy, minimization is hard |
scientific article; zbMATH DE number 5374656 |
Statements
Multigraph realizations of degree sequences: Maximization is easy, minimization is hard (English)
0 references
27 November 2008
0 references
computational complexity
0 references
combinatorial optimization
0 references
graph theory
0 references
0.79597407579422
0 references
0.7924084067344666
0 references
0.7733970880508423
0 references
0.7652808427810669
0 references
