Normal view MARC view ISBD view

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

By:

Ramachandran, V

Publication details: Berkeley Mathematical Sciences Research Institute 1985Description: 9 p 29 cm

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Comments ( 0 )

Holdings
Item type	Current library	Call number	Status	Date due	Barcode
Carti	IMAR	III 28851 (Browse shelf(Opens below))	Available		0027265

Browsing IMAR shelves Close shelf browser (Hides shelf browser)

Previous	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	Next
Previous	III 28848 Deterministic irreducibility testing of polynomials over large finite fields	III 28849 Greates common divisors of polynomials given by straight-line programs	III 28850 Factorization of polynomials given by straight-line programs	III 28851 The complexity of minimum cut and maximum flow problems in an acyclic network	III 28852 Fining a minimum freedback arc set in reducible flow graphs	III 28853 Quasiconformal actions on domains in space	III 28854 Minimum edge length guillotine rectangular partition	Next

There are no comments on this title.

to post a comment.

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)

Powered by Koha