An O(Nm) Time Algorithm for Finding the Min Length Directed Cycle in a Graph
In this paper, we introduce an O(nm) time algorithm to determine the minimum length directed cycle (also called the "minimum weight directed cycle") in a directed network with n nodes and m arcs and with no negative length directed cycles. This result improves upon the previous best time b...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Society for Industrial and Applied Mathematics,
2018-06-12T14:33:14Z.
|
| Subjects: | |
| Online Access: | Get fulltext |