The maximum clique enumeration problem: algorithms, applications, and implementations
JD Eblen, CA Phillips, GL Rogers, MA Langston - BMC bioinformatics, 2012 - Springer
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, and the maximal clique enumeration problem, which
asks that we compile a listing of all maximal cliques. Naturally, these three problems are NP-
hard, given that they subsume the classic version of the NP-complete clique decision …
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, and the maximal clique enumeration problem, which
asks that we compile a listing of all maximal cliques. Naturally, these three problems are NP-
hard, given that they subsume the classic version of the NP-complete clique decision …
The maximum clique enumeration problem: Algorithms, applications and implementations
JD Eblen, CA Phillips, GL Rogers… - International Symposium …, 2011 - Springer
Algorithms are designed, analyzed and implemented for the maximum clique enumeration
(MCE) problem, which 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, and the
maximal clique enumeration problem, which asks that we compile a listing of all maximal
cliques. Naturally, these three problems are \calNP-hard, given that they subsume the …
(MCE) problem, which 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, and the
maximal clique enumeration problem, which asks that we compile a listing of all maximal
cliques. Naturally, these three problems are \calNP-hard, given that they subsume the …
Showing the best results for this search. See all results