On finding two-connected subgraphs in planar graphs (Q1376267)
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 1097570
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On finding two-connected subgraphs in planar graphs |
scientific article; zbMATH DE number 1097570 |
Statements
On finding two-connected subgraphs in planar graphs (English)
0 references
17 December 1997
0 references
network survivability
0 references
Steiner tree
0 references
design of reliable networks
0 references
minimum-weight 2-connected subgraph
0 references
planar graph
0 references
polynomial-time algorithm
0 references
0 references
0.93569016
0 references
0.9169425
0 references
0.91611034
0 references
0.91238904
0 references
0 references
0.90287846
0 references
0.9024092
0 references
0.89390254
0 references
