Network flows and matchingde David S. Johnson, Catherine C. McGeochMateriasMathematicsComputer scienceSystem theoryComputer science, mathematicsEdiciones (1)Network flows and matching (1993)American Mathematical Society · inglésMás obras de David S. JohnsonTThe shortest path problemThe shortest path problemData structures, near neighbor searches, and methodologyCliques, Coloring, and Satisfiability: Second Dimacs Implementation Challenge, October 11-13, 1993 (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)
Cliques, Coloring, and Satisfiability: Second Dimacs Implementation Challenge, October 11-13, 1993 (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)
