Packing algorithms for arborescences (and spanning trees) in capacitated graphs (Q5101431): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/3-540-59408-6_67 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2171842972 / rank | |||
Normal rank | |||
Revision as of 23:05, 19 March 2024
scientific article; zbMATH DE number 7577907
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Packing algorithms for arborescences (and spanning trees) in capacitated graphs |
scientific article; zbMATH DE number 7577907 |
Statements
Packing algorithms for arborescences (and spanning trees) in capacitated graphs (English)
0 references
30 August 2022
0 references
