Why is maximum clique often easy in practice?
Jose L. Walteros, Austin Buchanan
| Year of publication: |
2020
|
|---|---|
| Authors: | Walteros, Jose L. ; Buchanan, Austin |
| Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 68.2020, 6, p. 1866-1895
|
| Subject: | maximum clique | fixed-parameter tractable | fpt | vertex cover | degeneracy | k-core | parameterized below degeneracy | kernelization | parameterized complexity | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Core |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1287/opre.2019.1970 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012392172