IPM - Institute for Research in Fundamental Sciences

“School of Mathematics”

Back to Papers Home
Back to Papers of School of Mathematics

Paper IPM / M / 119

School of Mathematics

Title:

A linear-time algorithm for minimum cost flow on undirected one-trees

Author(s):

1.	B. Kalantari
2.	I. Kalantari

Status:

In Proceedings

Proceeding:

Combinatorics Advances

Vol.:

329

Year:

1996

Pages:

217-223

Editor:

Math. Appl. (C.J. Colbourn and E.S. Mahmoodian, eds.)

Publisher(s):

Kluwer Academic Press, Dordrecht

Supported by:

IPM

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

“School of Mathematics”

People

Schools

Centers

Groups

E-Services

Publications