Instituto Universitario de Matemáticas y Aplicaciones
Forschungsinstitut
Massachusetts Institute of Technology
Cambridge, Estados UnidosPublikationen in Zusammenarbeit mit Forschern von Massachusetts Institute of Technology (2)
2017
-
An <i>O</i>(<i>nm</i>) time algorithm for finding the min length directed cycle in a graph
PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS
-
An O(nm) time algorithm for finding the min length directed cycle in a graph
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms