Solving the maximum clique and vertex coloring problems on very large sparse networks
Year of publication: |
2015
|
---|---|
Authors: | Verma, Anurag ; Buchanan, Austin ; Butenko, Sergiy |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 27.2015, 1, p. 164-177
|
Subject: | maximum clique | vertex coloring | very-large-scale networks | exact algorithm | k-community | k-core | clique relaxation | scale reduction | Algorithmus | Algorithm | Unternehmensnetzwerk | Business network | Mathematische Optimierung | Mathematical programming | Soziales Netzwerk | Social network | Netzwerk | Network | Graphentheorie | Graph theory |
-
A linear input dependence model for interdependent networks
Kaul, Hemanshu, (2022)
-
Chen, Fengzhang, (2020)
-
The vertex attack tolerance of complex networks
Matta, John, (2017)
- More ...
-
An integer programming approach for fault-tolerant connected dominating sets
Buchanan, Austin, (2015)
-
Soccer analytics using touch-by-touch match data
Butenko, Sergiy, (2014)
-
The maximum ratio clique problem
Sethuraman, Samyukta, (2015)
- More ...