March 26, 2007
Ruslan Savchenko
An algorithm on graphs
Abstract
Consider an undirected graph G with a designated node s. Let the edges of G be endowed with non-negative lengths. We present an efficient algorithm to find a shortest simple circuit that passes through s.
© 2006—2007
Kolmogorov seminar
Feedback