FINDING CENTERS AND MEDIANS OF GRAPHS IN PARALLEL

DOI10.1080/10637199608915567MaRDI QIDQ4820169zbMATH OpenOpenAlexFDO

Authors Pranay Chaudhuri

Publication date 6 October 2004

Published in Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10637199608915567

Mathematics Subject Classification ID

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

Cites work

• An 0(log n) parallel algorithm for strong connectivity augmentation problem
• Distributed algorithms for finding centers and medians in networks
• Parallel Matrix and Graph Algorithms
• Parallel computation and conflicts in memory access

This page was built for publication: FINDING CENTERS AND MEDIANS OF GRAPHS IN PARALLEL

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