Finding a Smallest Augmentation to Biconnect a Graph
type: Item
instance of: scholarly article
title: Finding a Smallest Augmentation to Biconnect a Graph
zbMATH Open document ID: 0782.68051
DOI: 10.1137/0222056
author: Tsan-sheng Hsu
author: Vijaya Ramachandran
published in: SIAM Journal on Computing
publication date: 1994-01-04T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 94C15
zbMATH DE Number: 446902
zbMATH Keywords: graph augmentation
zbMATH Keywords: biconnected graph
zbMATH Keywords: poly-log time
zbMATH Keywords: linear-time algorithm
zbMATH Keywords: EREW PRAM
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1137/0222056
OpenAlex ID: W2015645763
description: scientific article