Concurrent determination of connected components

DOI10.1016/S0167-6423(01)00007-7MaRDI QIDQ5949501zbMATH OpenFDO

Authors W. H. Hesselink, A. Meijster, Coenraad Bron

Publication date 22 July 2002

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-6423(01)00007-7

zbMATH Keywords

Tarjan's algorithm

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Parallel algorithms in computer science (68W10)

Recommendations

• Static and dynamic parallel computation of connected components
• Generalising connected components
• scientific article; zbMATH DE number 5879017
• Properties of connectivity components in parallel-sequential connections
• Determining connected components in linear time by a linear number of processors
• scientific article; zbMATH DE number 18406
• Algebraic investigation of connected components
• A stabilizing algorithm for finding biconnected components
• scientific article; zbMATH DE number 1057773
• Parallel algorithms for finding connected components of a graph

Cited in

(4)

• Low-latency connected component labeling using an FPGA
• Generalising connected components
• Salembier's min-tree algorithm turned into breadth first search
• Formal methods of paralleling the Tarjan algorithm

This page was built for publication: Concurrent determination of connected components

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5949501)