The MathNet Korea
Information Center for Mathematical Science

논문검색

Information Center for Mathematical Science

논문검색

SIAM Journal on Computing
( Vol. 24 NO.5 / (1995))
Minimum Cost Paths in Periodic Graphs
Franz Hofting, Egon Wanke,
Pages. 1051-1067
Abstract
Contents 1. Introduction and summary
2. The problem
3. The general solution
4. Pseudopolynomiaol time solutions
5. Bounds on the path-length
Key words periodic graphs, shortest paths, NP-completeness, integer linear programming, scheduling.
Mathmatical Subject Classification 05C12, 05C38, 68Q25, 68R10