A superclass of Edge-Path-Tree graphs with few cliques
Year of publication: |
2009
|
---|---|
Authors: | Apollonio, Nicola ; Caramia, Massimiliano |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 37.2009, 5, p. 351-355
|
Subject: | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Operations Research | Operations research |
-
Sum-of-squares representations for copositive matrices and independent sets in graphs
Vargas, Luis, (2023)
-
A lagrangean heuristic for the degree constrained minimal spanning tree problem
Kawatra, Rakesh, (2010)
-
Exact algorithms for OWA-optimization in multiobjective spanning tree problems
Galand, Lucie, (2012)
- More ...
-
A superclass of Edge-Path-Tree graphs with few cliques
Apollonio, Nicola, (2009)
-
A superclass of Edge-Path-Tree graphs with few cliques
Apollonio, Nicola, (2009)
-
The sunfish against the octopus : opposing compactness to gerrymandering
Apollonio, Nicola, (2006)
- More ...