Smarter Search for Vertex Cover I

Loading...
Do curso por Universidade de Stanford
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
244 ratings
Universidade de Stanford
244 ratings
Curso 4 de 4 em Specialization Algorithms

Conheça os instrutores

  • Tim Roughgarden
    Tim Roughgarden
    Professor
    Computer Science