On Finding and Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs
Sign Up to like & getrecommendations! Published in 2019 at "Algorithms"
DOI: 10.3390/a12010023
Abstract: 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… read more here.
Keywords: enumerating maximal; partite graphs; finding enumerating; partite cliques ... See more keywords