A linear algorithm for bipartition of biconnected graphs
type: Item
instance of: scholarly article
title: A linear algorithm for bipartition of biconnected graphs
zbMATH Open document ID: 0696.68074
DOI: 10.1016/0020-0190(90)90189-5
author: Hitoshi Suzuki
author: Naomi Takahashi
author: Takao Nishizeki
published in: Information Processing Letters
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W99
zbMATH DE Number: 4141515
zbMATH Keywords: linear algorithm
zbMATH Keywords: bipartition of biconnected graphs
zbMATH Keywords: depth-first search
MaRDI profile type: Publication
full work available at URL: 0020-0190(90)90189-5
OpenAlex ID: W1997165382
cites work: On the complexity of partitioning graphs into connected subgraphs
cites work: Q4168622
cites work: A homology theory for spanning tress of a graph
description: scientific article; zbMATH DE number 4141515