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

Descripción completa

Detalles Bibliográficos
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:
Article
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

Internet

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