An Asynchronous Parallel Algorithm for Undirected Graph Connectivity

DOI10.1006/JAGM.1995.1002MaRDI QIDQ4327814zbMATH OpenOpenAlexFDO

Authors Ofer Zajicek, Richard Cole

Publication date 9 April 1995

Published in Journal of Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL http://archive.org/details/asynchronouspara00cole

zbMATH Keywords

APRAM modelundirected graph

Mathematics Subject Classification ID

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

Cited in

(4)

• Approximating unweighted connectivity problems in parallel
• scientific article; zbMATH DE number 6708339 (Why is no real title available?)
• Parallel algorithms for connectivity problems in graph theory
• Partially Asynchronous, Parallel Algorithms for Network Flow and Other Problems

This page was built for publication: An Asynchronous Parallel Algorithm for Undirected Graph Connectivity

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