Why should biconnected components be identified first (Q1803675)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Why should biconnected components be identified first |
scientific article; zbMATH DE number 221653
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Why should biconnected components be identified first |
scientific article; zbMATH DE number 221653 |
Statements
Why should biconnected components be identified first (English)
0 references
29 June 1993
0 references
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.
0 references
decomposition procedure
0 references
biconnected components
0 references
