An efficient algorithm for evacuation problems in dynamic network flows with uniform arc capacity

Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

5 被引用数 (Scopus)

抄録

In this paper, we consider the quickest flow problem in a network which consists of a directed graph with capacities and transit times on its arcs. We present an O(n log n) time algorithm for the quickest flow problem in a network of grid structure with uniform arc capacity which has a single sink where n is the number of vertices in the network.

本文言語英語
ホスト出版物のタイトルAlgorithmic Aspects in Information and Management - Second International Conference, AAIM 2006, Proceedings
出版社Springer Verlag
ページ231-242
ページ数12
ISBN(印刷版)3540351574, 9783540351573
DOI
出版ステータス出版済み - 1 1 2006
外部発表はい
イベント2nd International Conference on Algorithmic Aspects in Information and Management, AAIM 2006 - Hong Kong, 中国
継続期間: 6 20 20066 22 2006

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
4041 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他2nd International Conference on Algorithmic Aspects in Information and Management, AAIM 2006
Country中国
CityHong Kong
Period6/20/066/22/06

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「An efficient algorithm for evacuation problems in dynamic network flows with uniform arc capacity」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル