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
Buch:
PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS

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

Datum der Publikation: 2017

Seiten: 1866-1879

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

Art: Konferenz-Beitrag

GOOGLE SCHOLAR
Fuente de los datos: WoS