Edge-disjoint minimum-weight connected spanning \(k\)-edge subgraphs in a weighted graph: A connectedness theorem (Q1584336)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Edge-disjoint minimum-weight connected spanning \(k\)-edge subgraphs in a weighted graph: A connectedness theorem |
scientific article; zbMATH DE number 1524927
| 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; zbMATH DE number 1524927 |
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
0.9003731
0 references
0.8967941
0 references
0.88964224
0 references
0.88161916
0 references
0.88100505
0 references
0.8792355
0 references
0.8787539
0 references
