The complexity of partitioning into disjoint cliques and a triangle-free graph.

Marin Bougeret Pascal Ochem

Published in: CoRR (2015)

Keyphrases

graph structure
weighted graph
graph partitioning
partitioning algorithm
maximal cliques
structured data
graph theoretic
graph mining
maximum clique
graph representation
graph model
graph theory
random walk
pairwise
vertex set
search algorithm
neural network
data objects
heuristic search
normalized cut