An ellipsoidal bounding scheme for the quasi-clique number of a graph
Year of publication: |
2020
|
---|---|
Authors: | Miao, Zhuqi ; Balasundaram, Balabhaskar |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 32.2020, 3, p. 763-778
|
Subject: | quasi-clique | clique relaxations | graph-based data mining | Lagrangian duality | Mathematische Optimierung | Mathematical programming | Data Mining | Data mining | Graphentheorie | Graph theory |
-
Algorithms for the maximum k-club problem in graphs
Shahinpour, Shahram, (2013)
-
On the 2-club polytope of graphs
Mahdavi Pajouh, Foad, (2016)
-
A branch-and-price framework for decomposing graphs into relaxed cliques
Gschwind, Timo, (2021)
- More ...
-
A branch-and-bound approach for maximum quasi-cliques
Mahdavi Pajouh, Foad, (2014)
-
Trukhanov, Svyatoslav, (2013)
-
On characterization of maximal independent sets via quadratic optimization
Mahdavi Pajouh, Foad, (2013)
- More ...