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

Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa

Research output: Contribution to journalArticlepeer-review

23 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)2372-2379
Number of pages8
JournalIEICE Transactions on Information and Systems
VolumeE89-D
Issue number8
DOIs
Publication statusPublished - Aug 2006
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'An efficient algorithm for evacuation problem in dynamic network flows with uniform arc capacity'. Together they form a unique fingerprint.

Cite this