Approximating unweighted connectivity problems in parallel

DOI10.1006/inco.2000.3003zbMath1005.68183OpenAlexW2013469322MaRDI QIDQ1854474

Zhi-Zhong Chen

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2000.3003

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Cites Work

• An improved parallel algorithm for maximal matching
• Derandomization through approximation
• Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex Connectivity
• Biconnectivity approximations and graph carvings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximating unweighted connectivity problems in parallel