On Finding and Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs

Authors

Charles A. Phillips
Kai Wang
Erich J. Baker
Jason A. Bubier, The Jackson LaboratoryFollow
Elissa J Chesler, The Jackson LaboratoryFollow
Michael A. Langston

Document Type

Article

Publication Date

2019

Keywords

JMG

JAX Source

Algorithms 2019; 12(1):23

DOI

https://doi.org/10.3390/a12010023

Grant

AA018776

Comments

This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).

Recommended Citation

Phillips CA, Wang K, Baker EJ, Bubier JA, Chesler E, Langston MA. On Finding and Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs Algorithms 2019; 12(1):23