Packing algorithms for arborescences (and spanning trees) in capacitated graphs (Q1290635): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q36943280, #quickstatements; #temporary_batch_1711094041063 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1136/jech.2006.053231 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1136/JECH.2006.053231 / rank | |||
Normal rank | |||
Latest revision as of 17:35, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Packing algorithms for arborescences (and spanning trees) in capacitated graphs |
scientific article |
Statements
Packing algorithms for arborescences (and spanning trees) in capacitated graphs (English)
0 references
15 September 1999
0 references
covering
0 references
Newton's method
0 references
capacitated digraphs
0 references
packing spanning trees
0 references
arborescence packing
0 references
laminar family of sets
0 references
