✦ LIBER ✦
On the equivalence in complexity among three computation problems on maximum number of edge-disjoint s−t paths in a probabilistic graph
✍ Scribed by Pen Cheng; Shigeru Masuyama
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 396 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.