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

Raka Jovanovic Tatsushi Nishi Stefan Voß

Published in: J. Heuristics (2017)

Keyphrases

connected components
graph mining
real world graphs
binary images
undirected graph
connected subgraphs
strongly connected components
level set
hyper graph
grey levels
weighted graph
connected component analysis
minimum spanning tree
watershed transformation
raster scan