Pessimal Algorithms and Simplexity Analysis (1984)

by Andrei Broder , Jorge Stolfi
Venue:ACM SIGACT News
Citations:3 - 0 self

Documents Related by Co-Citation

1 Random shuffles and group presentations – L Flatto, A M Odlyzko, D B Wales - 1985
1 Disney’s Mary Poppins. VHS Video Cassette – Walt - 1980
4 Fun-Sort -- Or the Chaos of Unordered Binary Search – Therese Biedl, Timothy Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai Golin, James A. King, J. Ianmunro - 2004
45 The New Hackers’ Dictionary – Eric S Raymond, ed - 1991
147 Seminumerical Algorithms, volume 2 of The Art of Computer Programming – Donald E Knuth - 1997
531 Concrete Mathematics – Donald E. Knuth, Ron Graham, Oren Patashnik I - 1989
1 Invitation to Graph Theory, SciTech – S Arumaygum, S Ramachandran - 2001
1 A First Look at Graph Theory, Allied – J Clark, D Holton - 1995
6 Graph Theory – N Deo - 1974
1 Recognizing Circle Graphs – C P Gabor, W L Hsu, K J Supowit - 1985
4 Multi-Layer Channel Routing: Complexity and Algorithms – Rajat K Pal - 2000
11 Shortest Connection Networks and Some – R C Prim - 1957
17 A New Approach to the Rectilinear Steiner Tree – J M Ho, G Vijayan, C K Wong - 1989
50 Combinatorial Algorithms – E M Reingold, J Nievergelt, N Deo - 1977
21 Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs – Sanjiv Kapoor, H. Ramesh - 1995
13 A powerful global router: based on Steiner min-max tree – C Chiang, M Sarrafzadeh, C K Wong - 1990
73 Finding a maximum cut of a planar graph in polynomial time – F Hadlock - 1975
10988 Computers and Intractability: A Guide to the Theory of NP-completeness – M Garey, D Johnson - 1979
439 On the shortest spanning subtree of a graph and the traveling salesman problem – J B Kruskal - 1956