Multicommodity flows in cycle graphs

Authors:
Young-Soo Myung
Affiliations:
Department of Business Administration, Dankook University, Cheonan, Chungnam, Korea
Venue:
Discrete Applied Mathematics
Year:
2006

Citing 4
Cited 1

Algorithms for routing around a rectangle

Discrete Applied Mathematics - Special issue: graphs in electrical engineering, discrete algorithms and complexity
An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting

SIAM Journal on Discrete Mathematics
Linear time algorithms for the ring loading problem with demand splitting

Journal of Algorithms
On the ring loading problem with demand splitting

Operations Research Letters

Communication: Integral polyhedra related to integer multicommodity flows on a cycle

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

This paper considers the multicommodity flow problem and the integer multicommodity flow problem on cycle graphs. We present two linear time algorithms for solving each of the two problems.