Загрузка...
The maximum clique enumeration problem: algorithms, applications, and implementations
BACKGROUND: The maximum clique enumeration (MCE) problem asks that we identify all maximum cliques in a finite, simple graph. MCE is closely related to two other well-known and widely-studied problems: the maximum clique optimization problem, which asks us to determine the size of a largest clique,...
Сохранить в:
| Главные авторы: | , , , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
BioMed Central
2012
|
| Предметы: | |
| Online-ссылка: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3382443/ https://ncbi.nlm.nih.gov/pubmed/22759429 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/1471-2105-13-S10-S5 |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|