Skip to Main Content
Algorithmische Graphentheorie, 4th Edition
book

Algorithmische Graphentheorie, 4th Edition

by Volker Turau, Christoph Weyer
September 2015
Intermediate to advanced content levelIntermediate to advanced
415 pages
12h 24m
German
De Gruyter
Content preview from Algorithmische Graphentheorie, 4th Edition

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 ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Mathematik

Mathematik

Bernd Ulmann
Kryptografie

Kryptografie

Klaus Schmeh
D3-Praxisbuch

D3-Praxisbuch

Philipp K. Janert

Publisher Resources

ISBN: 9783110417326