Art
J-GLOBAL ID：200902197421943621   Reference number：97A0657792

On associative shortest path problems.

連想最短路問題
Author (1)：
MARUYAMA Y

About MARUYAMA Y

(Nagasaki Univ., Nagasaki, JPN)

About Nagasaki Univ., Nagasaki, JPN


Material：
Bulletin of Informatics and Cybernetics  (Bull Inform Cybern)

About Bulletin of Informatics and Cybernetics


Volume： 29  Issue： 1  Page： 67-81  Publication year： Mar. 1997 
JST Material Number： L1047A  ISSN： 0286-522X  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  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

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

About Network methods

Terms in the title (2)：
Terms in the title
Keywords automatically extracted from the title.
連想

About 連想

, 
最短路問題

About 最短路問題


Return to Previous Page

TOP

BOTTOM