Balanced network flows. VIII: a revised theory of phase-ordered algorithms and the O( log(n2/m)/log n) bound for the nonbipartite cardinality matching problem
| Author: | Christian Fremuth-PaegerGND, Dieter JungnickelORCiDGND |
|---|---|
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/44704 |
| ISSN: | 0028-3045OPAC |
| ISSN: | 1097-0037OPAC |
| Parent Title (English): | Networks |
| Publisher: | Wiley |
| Place of publication: | New York, NY |
| Type: | Article |
| Language: | English |
| Year of first Publication: | 2003 |
| Release Date: | 2018/12/05 |
| Tag: | Computer Networks and Communications; Hardware and Architecture; Software; Information Systems |
| Volume: | 41 |
| Issue: | 3 |
| First Page: | 137 |
| Last Page: | 142 |
| DOI: | https://doi.org/10.1002/net.10066 |
| Institutes: | Mathematisch-Naturwissenschaftlich-Technische Fakultät |
| Mathematisch-Naturwissenschaftlich-Technische Fakultät / Institut für Mathematik | |
| Mathematisch-Naturwissenschaftlich-Technische Fakultät / Institut für Mathematik / Diskrete Mathematik, Optimierung und Operations Research |
