Edge-disjoint minimum-weight connected spanning \(k\)-edge subgraphs in a weighted graph: A connectedness theorem (Q1584336): 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/s0012-365x(97)00253-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2076080102 / rank | |||
Normal rank | |||
Latest revision as of 12:15, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Edge-disjoint minimum-weight connected spanning \(k\)-edge subgraphs in a weighted graph: A connectedness theorem |
scientific article |
Statements
Edge-disjoint minimum-weight connected spanning \(k\)-edge subgraphs in a weighted graph: A connectedness theorem (English)
0 references
2 November 2000
0 references
edge-disjoint spanning trees
0 references
weighted graph
0 references
interpolating theorem
0 references
graphical invariants
0 references
0 references
