3 citations · 3 across the 3 of their papers we have counts for
1 paper · 1 filter
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…