On minimally \(k\)-edge-connected graphs and shortest \(k\)-edge-connected Steiner networks (Q1410692): 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/s0166-218x(02)00465-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083365145 / rank | |||
Normal rank | |||
Latest revision as of 11:17, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On minimally \(k\)-edge-connected graphs and shortest \(k\)-edge-connected Steiner networks |
scientific article |
Statements
On minimally \(k\)-edge-connected graphs and shortest \(k\)-edge-connected Steiner networks (English)
0 references
14 October 2003
0 references
Edge-connectivity of graphs
0 references
Steiner networks
0 references
Steiner ratio
0 references
