Multigraph realizations of degree sequences : maximization is easy, minimization is hard
Year of publication: |
2008
|
---|---|
Authors: | Hulett, Heather ; Will, Todd G. ; Woeginger, Gerhard J. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 36.2008, 5, p. 594-596
|
Subject: | Komplexe Systeme | Complex systems | Graphentheorie | Graph theory | Operations Research | Operations research |
-
Editorial for the special issue: "Novel solutions and novel approaches in operational research"
Drobne, Samo, (2020)
-
Understanding voting behaviour in complex political systems
Lapatinas, Athanasios, (2014)
-
Alkan, Bugra, (2021)
- More ...
-
Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
Hulett, Heather, (2008)
-
Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
Hulett, Heather, (2008)
-
Unbounded knapsack problems with arithmetic weight sequences
Deineko, Vladimir G., (2011)
- More ...