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,...

Descripción completa

Detalles Bibliográficos
Autores principales: Eblen, John D, Phillips, Charles A, Rogers, Gary L, Langston, Michael A
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2012
Materias:
Proceedings
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3382443/
https://www.ncbi.nlm.nih.gov/pubmed/22759429
http://dx.doi.org/10.1186/1471-2105-13-S10-S5

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3382443/
https://www.ncbi.nlm.nih.gov/pubmed/22759429
http://dx.doi.org/10.1186/1471-2105-13-S10-S5

Ejemplares similares