Approximating unweighted connectivity problems in parallel
type: Item
instance of: scholarly article
title: Approximating unweighted connectivity problems in parallel
zbMATH Open document ID: 1005.68183
author: Zhi-Zhong Chen
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 1853216
MaRDI profile type: Publication
full work available at URL: inco.2000.3003
OpenAlex ID: W2013469322
cites work: Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex Connectivity
cites work: Q4875165
cites work: Q5501842
cites work: Q3140408
cites work: Q4845372
cites work: Q4763401
cites work: An improved parallel algorithm for maximal matching
cites work: Derandomization through approximation, an NC algorithm for minimum cuts
cites work: Q4385522
cites work: Q3138952
cites work: Q4234045
cites work: Biconnectivity approximations and graph carvings
cites work: Towards more precise parallel biconnectivity approximation
DOI: 10.1006/INCO.2000.3003
Recommended article: Q4370206
Recommended article: Parallel algorithms for connectivity problems in graph theory
Recommended article: Q4252419
Recommended article: Parallel algorithms for connectivity problems on interval graphs
Recommended article: An Asynchronous Parallel Algorithm for Undirected Graph Connectivity
Recommended article: An optimal parallel connectivity algorithm
Recommended article: An optimal parallel co-connectivity algorithm
Recommended article: Q3703296
Recommended article: An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph
Recommended article: Improved Approximation Algorithms for Uniform Connectivity Problems
description: scientific article; zbMATH DE number 1853216