Publicacións en colaboración con investigadores/as de Massachusetts Institute of Technology (2)

2017

  1. 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

  2. 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