| Augment or push: A computational study of bipartite matching and unit-capacity flow algorithms (1998) | |||||||||||||||
Abstract | |||||||||||||||
| This TR is a revision of the TR #97-127. The original TR was based on implementations written in different languages, different style, and using somewhat different low-level data structures. After learning that in some cases this results in a non-trivial performance difference, we rewrote some of the codes. The new codes are written in a uniform way. We also provide more sanity checks and better machine-independent measure of performance with our data. Finally, we expanded some parts of the report. | |||||||||||||||
Details der Publikation | |||||||||||||||
| |||||||||||||||