Salembier's Min-tree algorithm turned into breadth first search

Authors:
Wim H. Hesselink
Affiliations:
Department of Mathematics and Computing Science, Rijksuniversiteit Groningen P.O. Box 800, 9700 AV Groningen, The Netherlands
Venue:
Information Processing Letters
Year:
2003

Citing 4
Cited 1

Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)
Concurrent determination of connected components

Science of Computer Programming
A Comparison of Algorithms for Connected Set Openings and Closings

IEEE Transactions on Pattern Analysis and Machine Intelligence
Antiextensive connected operators for image and sequence processing

IEEE Transactions on Image Processing

An efficient algorithm for connected attribute thinnings and thickenings

ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part II

Quantified Score

Hi-index	0.89

Visualization

Abstract