Graph and Network Algorithms

ACM Computing Surveys

Volumn 28, Issue 1, 1996, Pages 43-45

  Khuller, Samir ^a   Raghavachari, Balaji ^b  

^a University of Maryland ^*  (United States)

^b The University of Texas at Dallas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3142647463     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/234313.234334     Document Type: Article

References (9)

1. Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. 1993. Network Flows. Prentice Hall, Englewood Cliffs, NJ.
2. Bondy, J. A. and Murty, U. S. R. 1977. Graph Theory with Applications. American Elsevier, New York.
3. Cormen, T. H., Leiserson, C. E., and Rivest, R. L. 1989. Introduction to Algorithms. MIT Press, Cambridge, MA.
4. Even, S. 1979. Graph Algorithms. Computer Science Press, Potomac, MD.
5. Garey, M. R. and Johnson, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco.
6. Hochbaum, D. 1996. Approximation Algorithms. Edited volume under preparation, PWS, Boston, MA (in press).
7. Lovasz, L. and Plummer, M. D. 1986. Matching Theory. Elsevier B.V., New York.
8. Papadimitriou, C. H. and Steiglitz, K. 1982. Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, Englewood Cliffs, NJ.
9. Tarjan, R. E. 1983. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia.