Solving the maximum clique and vertex coloring problems on very large sparse networks
Anurag Verma; Austin Buchanan; Sergiy Butenko
| 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 |
| Extent: | graph. Darst. |
|---|---|
| Type of publication: | Article |
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10010505031