On the Edge Importance Using Its Traffic Based on a Distribution Function along Shortest Paths in a Network

スポンサーリンク

概要

• 論文の詳細を見る

• We model a road network as a directed graph G=(V, E) with a source s and a sink t, where each edge e has a positive length l(e) and each vertex υ has a distribution function α_υ with respect to the traffic entering and leaving υ. This paper proposes a polynomial time algorithm for evaluating the importance of each edge e ∈ E which is defined to be the traffic f(e) passing through e in order to assign the required traffic F_<st>(>0) from s to t along only shortest s-t paths in accordance with the distribution function α_υ at each vertex υ

• 社団法人電子情報通信学会の論文
• 1995-03-25

著者

• Cheng Peng

  College Of Information Science And Cultural Studies Nagoya Shokadaigaku

• Masuyama Shigeru

  Faculty Of Engineering Toyohashi University Of Technology

関連論文

• On the Edge Importance Using Its Traffic Based on a Distribution Function along Shortest Paths in a Network

スポンサーリンク