scientific article; zbMATH DE number 1057773

zbMATH Open0882.68071MaRDI QIDQ4352828FDOQ4352828

Authors: Steve Goddard, Subodh Kumar, Jan F. Prins 

Publication date: 4 February 1998

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

connected components

Mathematics Subject Classification ID

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

Cited In (13)

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Parallel algorithms for gray-scale digitized picture component labeling on a mesh-connected computer
• Title not available (Why is that?)
• A distributed-memory algorithm for connected components labeling of simulation data
• Graph Problems on a Mesh-Connected Processor Array
• Finding strongly connected components in distributed graphs
• 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)