Art
J-GLOBAL ID：200902168759009983   Reference number：99A0501519

Finding the k shortest paths.

k最短経路を見つける
Author (1)：
EPPSTEIN D

About EPPSTEIN D

(Univ. California, CA)

About Univ. California, CA


Material：
SIAM Journal on Computing (Society for Industrial and Applied Mathematics)  (SIAM J Comput (Soc Ind Appl Math))

About SIAM Journal on Computing (Society for Industrial and Applied Mathematics)


Volume： 28  Issue： 2  Page： 652-673  Publication year： Jul. 1998 
JST Material Number： D0944A  ISSN： 0097-5397  CODEN： SMJCAT  Document type： Article
Article type： 原著論文  Country of issue： United States (USA)  Language： ENGLISH (EN)
Thesaurus term：
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
*shortest route problem

About shortest route problem

,...
Semi thesaurus term：
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
computational complexity

About computational complexity


   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=99A0501519&from=J-GLOBAL&jstjournalNo=D0944A") }}
JST classification (2)：
JST classification
Category name(code) classified by JST.
Network methods 
(KA03040X)

About Network methods

,  Basics of graph theory 
(IA02020S)

About Basics of graph theory

Terms in the title (1)：
Terms in the title
Keywords automatically extracted from the title.
最短経路

About 最短経路


Return to Previous Page

TOP

BOTTOM