FINDING THE K QUICKEST SIMPLE PATHS IN A NETWORK

NCU Institutional Repository > 管理學院 > 資訊管理研究所 > 期刊論文 > Item 987654321/29695

請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29695

題名:	FINDING THE K QUICKEST SIMPLE PATHS IN A NETWORK
作者:	CHEN,YL
貢獻者:	資訊管理研究所
關鍵詞:	ALGORITHMS
日期:	1994
上傳時間:	2010-06-29 20:38:26 (UTC+8)
出版者:	中央大學
摘要:	Let N be a network with n nodes and m arcs, and let sigma be the amount of data to be transmitted. The quickest path problem is to find a routing path in N such that the time required to ship sigma units of data from the source to the sink is minimum. The problem considered in this paper is to find the first k quickest simple paths for a given pair of nodes, and an algorithm is designed. The complexity required by the proposed algorithm is O(kmn3 + kmn log k) if the network is directed and is O(kmn2 + kmn log k) if the network is undirected.
關聯:	INFORMATION PROCESSING LETTERS
顯示於類別:	[資訊管理研究所] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	582	檢視/開啟

在NCUIR中所有的資料項目都受到原著作權保護.

社群 sharing