A heuristic approach for dividing graphs into bi-connected components with a size constraint.

Raka Jovanovic Tatsushi Nishi Stefan Voss

Published in: CoRR (2016)

Keyphrases

connected components
graph mining
real world graphs
binary images
undirected graph
connected component labeling
level set
strongly connected components
connected subgraphs
data sets
image processing
directed graph
branch and bound algorithm
power law
hyper graph
connected component analysis