An <i>O</i>(<i>nm</i>) time algorithm for finding the min length directed cycle in a graph

  1. Orlin, James B.
  2. Sedeno-Noda, Antonio
Livre:
PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS

ISBN: *****************

Année de publication: 2017

Pages: 1866-1879

Congreso: 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

Type: Communication dans un congrès

GOOGLE SCHOLAR
La source de données: WoS