UMass INFORMS Speaker Series: Talk by Prof. James Orlin

'The Shortest Cycle Problem and Related Graph Theory and Algorithms​': We present the fastest algorithm for finding a shortest cycle in a directed graph. The new algorithm is actually simpler than previous fast algorithms for the shortest cycle problem. We also present a very brief history of algorithms for finding cycles in graphs as well as some new (and old) complexity results about cycles in graphs.

Refreshments at 10:30am. Presentation runs from 11am-12noon.