Normal view MARC view ISBD view

The complexity of minimum cut and maximum flow problems in an acyclic network

Ramachandran, V

The complexity of minimum cut and maximum flow problems in an acyclic network V. Ramachandran - Berkeley Mathematical Sciences Research Institute 1985 - 9 p 29 cm

Print
Add to your cart (remove)
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS ISBD
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)