An efficient and fast parallel-connected component algorithm

DOI10.1145/79147.214077zbMath0699.68064DBLPjournals/jacm/HanW90OpenAlexW1993297915WikidataQ56518875 ScholiaQ56518875MaRDI QIDQ3477960

Yijie Han, Robert A. Wagner

Publication date: 1990

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/79147.214077

zbMATH Keywords

algorithmsgraphconnectivityparallel algorithmoptimal algorithmscomputation on discrete structuresdata structures graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (2)

A numerical algorithm for zero counting. I: Complexity and accuracy ⋮ Static and dynamic parallel computation of connected components

This page was built for publication: An efficient and fast parallel-connected component algorithm