On the complexity of the {k}-packing function problem
Year of publication: |
January-March 2017
|
---|---|
Authors: | Dobson, M. Patricia ; Hinrichsen, Erica ; Leoni, Valeria |
Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 24.2017, 1/2, p. 347-354
|
Subject: | chordal graph | NP-completeness | polynomial instances | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory |
-
Finding clique clusters with the highest betweenness centrality
Rysz, Maciej, (2018)
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
-
Hosseinian, Seyedmohammadhossein, (2020)
- More ...
-
On the complexity of the labeled domination problem in graphs
Argiroffo, Gabriela, (2017)
- More ...