Management Science and Financial Engineering

  • 제8권1호
  • /
  • Pages.39-51
  • /
  • 2002
  • /
  • 2287-2043(pISSN)
  • /
  • 2287-2361(eISSN)
한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지

Maximum Flow in Self-Similar Flow Networks

  • Fathabadi, H.Salehi (Department of Mathematics and Computers Science University of Tehran, Tehran, IRAN) ;
  • Toloo, M. (Department of Mathematics, Islamic Azad University Science and Research Branch, Tehran, IRAN)
  • 발행 : 2002.05.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Special structure of flow networks can reduce the order of the relative existent algorithms. In this paper a special structure of flow network called self-similar f1ow networks is introduced, After describing such networks an efficient algorithm for finding maximum flow is presented. It is shown that this algorithm runs in O(m) time.

키워드

참고문헌

  1. Ahuja, R. K., T. L. Magnanti and J. b. Orllin, Network Flows: Theory and applications, Prentice Hall, 1993
  2. Ahuja, R. K., T. L. Magnanti and J. b. Orllin, 'Some Recent Development in Network Flows,' SIAM Review 33, 2 (1991), 175-219 https://doi.org/10.1137/1033048
  3. Bazaraa M. S., J. J. Jarvis and H. D. Sherali, Linear Programming and Network Flows, Second Edition, Wiley and Sons, 1990
  4. Bein, W. W., P. Brucker and A. Tamir, 'Minimum Cost Flow Algorithms For Serial-Parallel Netwoks,' Discrete Apll. Math. 10, 117-124, 1985 https://doi.org/10.1016/0166-218X(85)90006-X
  5. Bondy, J. A. and C. S. R. Murty, Graph Theory with Applications, The Macmillan Press Ltd, 1977
  6. Dinie, E. A., 'Algorithm For Solution of A Problem of Maximum Flow in Networks with Power Estimation,' Soviet Mathematics Doklady, 1277-1280 1970