Using Design Patterns for Reusable, Efficient Implementations of Graph Algorithms (1996)

Cached

Download Links

by Dietmar Kühl , Karsten Weihe
Citations:1 - 1 self

Documents Related by Co-Citation

3 Iterators evaluate table queries – Dieter Gluche, Dietmar Kuhl, Karsten Weihe - 1998
2 Finding shortest paths in very large networks – Eugene L Lawler, Michael Luby, B Parker - 1983
15 Reuse of algorithms: Still a challenge to object-oriented programming – K Weihe - 1997
2 Iterators and handles for nodes and edges in graphs – D Kuhl, K Weihe - 1996
85 STL Tutorial and Reference Guide – D R Musser, G J Derge, A Saini - 2001
9 Naher: LEDA: a library of efficient data structures and algorithms – K Mehlhorn - 1995
5 Combining LEDA with Customizable Implementations of Graph Algorithms – Marco Nissen, Marco Nissen, Karsten Weihe, Karsten Weihe - 1996
5 Toward a programming environment for combinatorial optimization: A case study oriented to max-flow computations – G Gallo, M G Scutella - 1993
6 Data access templates – Dietmar Kuhl, Karsten Weihe - 1997
1441 Object-oriented Software Construction – Bertrand Meyer - 2004
533 Network Flows – R Ahuja, T Magnanti, J Orlin - 1993
421 Combinatorial Algorithms for Integrated Circuit Layout – T Lengauer - 1990