Literatur
| [1] | AHUJA, R. K. ; MAGNANTI, T. L. ; ORLIN,J. B.: Network Flows: Theory, Algorithms, and Applications. Upper Saddle River, USA : Prentice Hall, 1993 |
| [2] | AHUJA, R. K. ; MEHLHORN, K. ; ORLIN, J. ; TARJAN, R. E.: Faster Algorithms for the Shortest Path Problem. In: Journal of the ACM 37 (1990), Nr. 2, S. 213-223 |
| [3] | ALON, N. : A Simple Algorithm for Edge-Coloring Bipartite Multigraphs. In: Information Processing Letters 85 (2003), Nr. 6, S. 301-302 |
| [4] | ALT, H. ; BLUM, N. ; MEHLHORN, K. ; PAUL, M. : Computing a maximum cardinality matching in a bipartite graph in time 0(nL5 √m/ log n). In: Information Processing Letters 37 (1991), Nr. 4, S. 237-240 |
| [5] | ANDRÉ, P. ; ROYER, J.-C. : Optimizing Method Search with Lookup Caches and ... |
Get Algorithmische Graphentheorie, 4th Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
