Management Science and Financial Engineering

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

Essential Arcs of a Directed Acyclic Graph

  • Chung, Ee-Suk (Dept. of Industrial Engineering, Korea Advanced Institute of Science and Technology)
  • Published : 2007.05.31
Download PDF
⟨ Previous Next ⟩

Abstract

Among many graphs, directed acyclic graph(DAG) attracts many researchers due to its nice property of existence of topological sort. In some classic graph problems, it is known that, if we use the aforementioned property, then much efficient algorithms can be generated. So, in this paper, new algorithm for the all-pairs shortest path problem in a DAG is proposed. While the algorithm performing the iteration, it identifies the set of essential arcs which requires in a shortest path. So, the proposed algorithm has a running time of $O(m^*n+m)$, where m, n and $m^*$ denote the number of arcs, number of node, and the number of essential arcs in a DAG, respectively.

Keywords

References

  1. Bellman, R., 'On a routing problem,' Quarterly of Applied Mathematics 16, 1 (1958), 87-90 https://doi.org/10.1090/qam/102435
  2. Dijkstra, E. W., 'A note on two problems in connexion with graphs,' Numerische Mathematik 1 (1959), 269-271 https://doi.org/10.1007/BF01386390
  3. Johnson, D. B., 'Efficient algorithms for shortest paths in sparse networks,' Journal of the ACM 24, 1 (1977), 1-13 https://doi.org/10.1145/321992.321993
  4. Karger, D. R., D. Koller, and S. J. Phillips, 'Finding the hidden path: Time bounds for all-pairs shortest paths,' SIAM Journal on Computing 22, 6(1993), 1199-1217 https://doi.org/10.1137/0222071
  5. Lawler, E. L., Combinatorial Optimization: Networks and Matrioids, Holt, Rinehart, and Winston, 1976
  6. Ford, L. R. Jr. and D. R. Fulkerson, Flows in Networks, Princeton University Press, 1962
  7. McGeoch, C. C, 'All-pairs shortest paths and the essential subgraph,' Algorithmica 13 (1995), 426-441 https://doi.org/10.1007/BF01190847