collaborators

1 paper

cs.DM2023

Enumerating All Maximal Clique-Partitions of an Undirected Graph

Mircea Marin, Temur Kutsia, Cleo Pau +1

We address the problem of enumerating all maximal clique-partitions of an undirected graph and present an algorithm based on the observation that every maximal clique-partition can…