“School of Mathematics”
Back to Papers HomeBack to Papers of School of Mathematics
Paper IPM / M / 119 | ||||||||||||||||||||||||||
|
||||||||||||||||||||||||||
Abstract: | ||||||||||||||||||||||||||
We give an O(n)-time algorithm for the
minimum cost flow problem over an undirected one-tree with n vertices. A one-tree is a spanning tree with one additional edge.
Download TeX format |
||||||||||||||||||||||||||
back to top |