Login / Signup
Efficiently computing k-edge connected components via graph decomposition.
Lijun Chang
Jeffrey Xu Yu
Lu Qin
Xuemin Lin
Chengfei Liu
Weifa Liang
Published in:
SIGMOD Conference (2013)
Keyphrases
</>
connected components
efficiently computing
undirected graph
binary images
strongly connected components
graph mining
level set
edge information
olap data cubes
multiscale
edge detection
edge detector
level lines
real world graphs
weighted graph