BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-80-794
       ENTRY:: June 08, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Recent developments in the complexity of combinatorial
               algorithms
        TYPE:: Technical Report
      AUTHOR:: Tarjan, Robert Endre
        DATE:: June 1980
       PAGES:: 30
    ABSTRACT:: The last three years have witnessed several major advances in
               the area of combinatorial algorithms. These include improved
               algorithms for matrix multiplication and maximum network
               flow, a polynomial-time algorithm for linear programming, and
               steps toward a polynomial-time algorithm for graph
               isomorphism. This paper surveys these results and suggests
               directions for future research. Included is a discussion of
               recent work by the author and his students on dynamic
               dictionaries, network flow problems, and related questions.
       NOTES:: [Adminitrivia V1/Prg/19950608]
         END:: STAN//CS-TR-80-794