Edge-disjoint minimum-weight connected spanning \(k\)-edge subgraphs in a weighted graph: A connectedness theorem (Q1584336): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q831023 |
Changed an Item |
||
| Property / author | |||
| Property / author: Xue Liang Li / rank | |||
Normal rank | |||
Revision as of 06:04, 21 February 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
