On finding two-connected subgraphs in planar graphs (Q1376267): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 04:08, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On finding two-connected subgraphs in planar graphs |
scientific article |
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