An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree (Q1861569)
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: An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree |
scientific article; zbMATH DE number 1878529
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree |
scientific article; zbMATH DE number 1878529 |
Statements
An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree (English)
0 references
9 March 2003
0 references
approximation algorithm
0 references
edge-connectivity
0 references
tree
0 references
graphs
0 references
spanning subgraph
0 references
graph augmentation
0 references
2-edge-connectivity
0 references
polynomial algorithm
0 references
matching
0 references
