A Computationally Efficient Connectivity Measure for Random Graphs.

Hamid Mahboubi Mohammad Mehdi Asadi Amir G. Aghdam Stéphane Blouin

Published in: GLOBECOM (2015)

Keyphrases

random graphs
computationally efficient
connected components
graph theoretic
computational complexity
phase transition
small world
learning curves
binary images
image segmentation
data structure