Finding biconnected components in O(n) time for a class of graphs
type: Item
instance of: scholarly article
title: Finding biconnected components in O(n) time for a class of graphs
zbMATH Open document ID: 0875.68707
DOI: 10.1016/S0020-0190(96)00153-6
author: Y. Daniel Liang
author: Chongkye Rhee
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 983899
zbMATH Keywords: Algorithms
zbMATH Keywords: Biconnected component
zbMATH Keywords: Breadth-first search
MaRDI profile type: Publication
cites work: Q3328583
cites work: Why should biconnected components be identified first
cites work: Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
full work available at URL: s0020-0190(96)00153-6
OpenAlex ID: W2010357409
description: scientific article; zbMATH DE number 983899