Your search returned 2 results.

Sort
Results
1.
Fining a minimum freedback arc set in reducible flow graphs V. Ramachandran by
Publication details: Berkeley Mathematical Sciences Research Institute 1985
Availability: Items available for loan: IMAR (1)Call number: III 28852.

2.
The complexity of minimum cut and maximum flow problems in an acyclic network V. Ramachandran by
Publication details: Berkeley Mathematical Sciences Research Institute 1985
Availability: Items available for loan: IMAR (1)Call number: III 28851.

Pages

Powered by Koha