Login / Signup
Improved Linear-Time Algorithm for Computing the 4-Edge-Connected Components of a Graph.
Loukas Georgiadis
Giuseppe F. Italiano
Evangelos Kosinas
Published in:
CoRR (2021)
Keyphrases
</>
connected components
undirected graph
graph structure
binary images
worst case
weighted graph
connected component labeling
level lines
grey levels
connected component analysis
hyper graph
strongly connected components
minimum spanning tree
image processing algorithms
spanning tree
segmentation algorithm
level set