Algorithms for dense graphs and networks on the random access computer (1996)

View PDF

Download Links

by J. Cheriyan , K. Mehlhorn
Venue: ALGORITHMICA
Citations:22 - 4 self

Documents Related by Co-Citation

568 An n 5/2 algorithm for maximum matchings in bipartite graphs – J E Hopcroft, R M Karp - 1973
1093 Depth first search and linear graph algorithms – Robert Tarjan - 1972
407 Theoretical improvements in algorithmic efficiency for network flow problems – Jack Edmonds, Richard M. Karp - 1972
492 Combinatorial Optimization: Networks and Matroids – E Lawler - 1976
591 Fibonacci heaps and their uses in improved network optimization algorithms – M L Fredman, R E Tarjan
73 Clique Partitions, Graph Compression and Speeding-up Algorithms – Tomás Feder, Rajeev Motwani - 1991
674 LEDA: A Platform for Combinatorial and Geometric Computing – Kurt Mehlhorn, Stefan Näher, Christian Uhrig - 1999
2564 h~ Design and Analysis of Computer Algorithms – J E Hopcroft, J D Ullman - 1974
840 Matrix multiplication via arithmetic progressions – D Coppersmith, S Winograd - 1987