On finding two-connected subgraphs in planar graphs (Q1376267): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0167-6377(96)00046-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2020904545 / rank | |||
Normal rank | |||
Revision as of 09:41, 30 July 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
0 references
