Packing algorithms for arborescences (and spanning trees)...

Mathematical Programming 1998 / 06 Vol. 82; Iss. 1-2

Packing algorithms for arborescences (and spanning trees) in capacitated graphs

Harold N. Gabow, K. S. Manu
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
82
Language:
english
Pages:
27
Journal:
Mathematical Programming
DOI:
10.1007/bf01585866
Date:
June, 1998
File:
PDF, 1.95 MB
english, 1998
Conversion to is in progress
Conversion to is failed