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

DOI10.1137/1.9781611974782.122zbMath1410.68304OpenAlexW2907002631MaRDI QIDQ4575868

Antonio Sedeño-Noda, James B. Orlin

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974782.122

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

On the Power of Tree-Depth for Fully Polynomial FPT Algorithms ⋮ Methods for determining cycles of a specific length in undirected graphs with edge weights ⋮ A fast algorithm for source-wise round-trip spanners

This page was built for publication: An O(nm) time algorithm for finding the min length directed cycle in a graph