WorldCat Linked Data Explorer

Turtle N-Triple JSON-LD RDF/XML HTML Contact Us Home

http://worldcat.org/entity/work/id/137190052

Recent developments in the complexity of combinatorial algorithms

Several major advances in the area of combinatorial algorithms 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.

Open All Close All

type

about

http://schema.org/about

contributor

creator

description

http://schema.org/description

  • "Several major advances in the area of combinatorial algorithms 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."@en

name

http://schema.org/name

  • "Recent developments in the complexity of combinatorial algorithms"@en
  • "Recent developments in the complexity of combinatorial algorithms"
  • "Recent Developments in the Complexity of Combinatorial Algorithms"
  • "Recent Developments in the Complexity of Combinatorial Algorithms"@en

workExample