An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree (Q4938657)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1405676
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree |
scientific article; zbMATH DE number 1405676 |
Statements
23 February 2000
0 references
0.9906659126281738
0 references
0.9902697801589966
0 references
0.8674583435058594
0 references
0.8561075329780579
0 references
An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree (English)
0 references
