Cargando…
On Finding and Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs
Let k denote an integer greater than 2, let G denote a k-partite graph, and let S denote the set of all maximal k-partite cliques in G. Several open questions concerning the computation of S are resolved. A straightforward and highly-scalable modification to the classic recursive backtracking approa...
Autores principales: | Phillips, Charles A., Wang, Kai, Baker, Erich J., Bubier, Jason A., Chesler, Elissa J., Langston, Michael A. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6707360/ https://www.ncbi.nlm.nih.gov/pubmed/31448059 http://dx.doi.org/10.3390/a12010023 |
Ejemplares similares
-
The maximum clique enumeration problem: algorithms, applications, and implementations
por: Eblen, John D, et al.
Publicado: (2012) -
Viral Quasispecies Assembly via Maximal Clique Enumeration
por: Töpfer, Armin, et al.
Publicado: (2014) -
Biclique: an R package for maximal biclique enumeration in bipartite graphs
por: Lu, Yuping, et al.
Publicado: (2020) -
GeneWeaver: finding consilience in heterogeneous cross-species functional genomics data
por: Bubier, Jason A., et al.
Publicado: (2015) -
An Iterated Tabu Search Approach for the Clique Partitioning Problem
por: Palubeckis, Gintaras, et al.
Publicado: (2014)