BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-77-609
       ENTRY:: June 28, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Complexity of combinatorial algorithms
        TYPE:: Technical Report
      AUTHOR:: Tarjan, Robert Endre
        DATE:: April 1977
       PAGES:: 90
    ABSTRACT:: This paper examines recent work on the complexity of
               combinatorial algorithms, highlighting the aims of the work,
               the mathematical tools used, and the important results.
               Included are sections discussing ways to measure the
               complexity of an algorithm, methods for proving that certain
               problems are very hard to solve, tools useful in the design
               of good algorithms, and recent improvements in algorithms for
               solving ten representative problems. The final section
               suggests some directions for future research.
       NOTES:: [Adminitrivia V1/Prg/19950628]
         END:: STAN//CS-TR-77-609