FAST PARALLEL ALGORITHMS FOR FINDING CUTPOINTS AND BRIDGES OF UNDIRECTED GRAPHS
type: Item
instance of: scholarly article
title: FAST PARALLEL ALGORITHMS FOR FINDING CUTPOINTS AND BRIDGES OF UNDIRECTED GRAPHS
zbMATH Open document ID: 1049.68922
DOI: 10.1080/10637199408962525
author: Stavros D. Nikolopoulos
author: Stylianos D. Danielopoulos
published in: Parallel Algorithms and Applications
publication date: 2004-10-06T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 2106620
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1080/10637199408962525
OpenAlex ID: W2508874684
cites work: Q4023518
cites work: Fast parallel graph searching with applications
cites work: Parallel computation and conflicts in memory access
cites work: Fast, Efficient Parallel Algorithms for Some Graph Problems
cites work: An O(logn) parallel connectivity algorithm
cites work: A general program scheme for finding bridges
cites work: An Efficient Parallel Biconnectivity Algorithm
cites work: Implementation of simultaneous memory address access in models that forbid it
description: scientific article; zbMATH DE number 2106620