The complexity of minimum cut and maximum flow problems in an acyclic network V. Ramachandran
Publication details: Berkeley Mathematical Sciences Research Institute 1985Description: 9 p 29 cmItem type | Current library | Call number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|
Carti | IMAR | III 28851 (Browse shelf(Opens below)) | Available | 0027265 |
There are no comments on this title.
Log in to your account to post a comment.