A parallel algorithm for connected components on distributed memory machines

DOI10.1007/3-540-45417-9_39MaRDI QIDQ4785975zbMATH OpenFDO

Authors Libor Buš, Pavel Tvrdík

Publication date 12 December 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2131/21310280

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 1057771
• scientific article; zbMATH DE number 1057773
• A new class of parallel algorithms for finding connected components on machines with bit-vector operations
• scientific article; zbMATH DE number 1057772
• Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM

Cited in

(8)

• Finding strongly connected components in distributed graphs
• K-means-type algorithms on distributed memory computer
• scientific article; zbMATH DE number 434529 (Why is no real title available?)
• An efficient and fast parallel-connected component algorithm
• scientific article; zbMATH DE number 1057771 (Why is no real title available?)
• scientific article; zbMATH DE number 1057772 (Why is no real title available?)
• A distributed-memory algorithm for connected components labeling of simulation data
• scientific article; zbMATH DE number 5879017 (Why is no real title available?)

This page was built for publication: A parallel algorithm for connected components on distributed memory machines

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