Fast algorithms for even/odd minimum cuts and generalizations
Benczúr, András and Fülöp, O. (2000) Fast algorithms for even/odd minimum cuts and generalizations. In: - Springer, Berlin, pp. 88-99.
Full text not available from this repository.Item Type: | Book Section |
---|---|
Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
Divisions: | Informatics Laboratory |
Depositing User: | Eszter Nagy |
Date Deposited: | 11 Dec 2012 15:06 |
Last Modified: | 11 Dec 2012 15:06 |
URI: | https://eprints.sztaki.hu/id/eprint/2302 |
Update Item |