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

Information Processing Letters

Volumn 88, Issue 5, 2003, Pages 225-229

  Hesselink, Wim H ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

Connected component; Graph algorithms; Spanning tree; Threshold set

Indexed keywords

FUNCTIONS; GRAPH THEORY; SET THEORY; THEOREM PROVING;

CONNECTED COMPONENTS;

ALGORITHMS;

EID: 0242271288     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2003.08.003     Document Type: Article

References (5)

1. Hesselink W.H., Meijster A., Bron C. Concurrent determination of connected components. Sci. Comput. Programm. 41:2001;173-194.
2. W.H. Hesselink, J.E. Jonker, A. Meijster, M.H.F. Wilkinson, Accumulating attributes over growing connected components, in preparation.
3. Meijster A., Wilkinson M.H.F. A comparison of algorithms for connected set openings and closings. IEEE Trans. Pattern Analysis and Machine Intelligence. 24:2002;484-494.
4. Salembier P., Oliveras A., Garrido L. Anti-extensive connected operators for image and sequence processing. IEEE Trans. Image Process. 7:1998;555-570.
5. Tarjan R.E. Efficiency of a good but not linear set union algorithm. J. ACM. 22:1975;215-225.