scientific article; zbMATH DE number 1057773

MaRDI QIDQ4352828zbMATH OpenFDO

Authors Steve Goddard, Subodh Kumar, Jan F. Prins

Publication date 4 February 1998

zbMATH Keywords

connected components

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• A new class of parallel algorithms for finding connected components on machines with bit-vector operations
• An efficient and fast parallel-connected component algorithm
• scientific article; zbMATH DE number 3930349
• Fast Connected Components Algorithms for the EREW PRAM

Cited in

(13)

• scientific article; zbMATH DE number 1751891 (Why is no real title available?)
• Comparative study and proof of single-pass connected components algorithms
• Algorithm Theory - SWAT 2004
• Graph connectivity in log steps using label propagation
• Concurrent determination of connected components
• Parallel algorithms for gray-scale digitized picture component labeling on a mesh-connected computer
• scientific article; zbMATH DE number 3860407 (Why is no real title available?)
• scientific article; zbMATH DE number 1844551 (Why is no real title available?)
• A distributed-memory algorithm for connected components labeling of simulation data
• Finding strongly connected components in distributed graphs
• Graph Problems on a Mesh-Connected Processor Array
• IMPLEMENTING HIRSCHBERG'S PRAM-ALGORITHM FOR CONNECTED COMPONENTS ON A GLOBAL CELLULAR AUTOMATON
• A new class of parallel algorithms for finding connected components on machines with bit-vector operations

This page was built for publication:

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