Why should biconnected components be identified first
type: Item
instance of: scholarly article
title: Why should biconnected components be identified first
zbMATH Open document ID: 0789.90084
DOI: 10.1016/0166-218X(93)90046-Q
author: Dorit S. Hochbaum
published in: Discrete Applied Mathematics
publication date: 1993-06-29T00:00:00Z
review text: Most optimization algorithms for combinatorial problems on graphs assume that the graph is connected. The paper describes a decomposition procedure that reduces the solution for some problems solving them only on the biconnected components of the graph.
reviewed by: J.Mitev
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 221653
zbMATH Keywords: decomposition procedure
zbMATH Keywords: biconnected components
MaRDI profile type: Publication
cites work: Q4194455
cites work: Efficient bounds for the stable set, vertex cover and set packing problems
description: scientific article; zbMATH DE number 221653