Art

J-GLOBAL ID：200902120777758117   Reference number：99A0225529

The Complexity of an Optimal File Transfer Problem.

最適ファイル転送問題の複雑度

Author (2)： KANEKO Y (Gifu Univ., Gifu-shi, JPN) ,  SHINODA S (Chuo Univ., Tokyo, JPN)
Material： IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Institute of Electronics, Information and Communication Engineers)  (IEICE Trans Fundam Electron Commun Comput Sci (Inst Electron Inf Commun Eng))
Volume： E82-A  Issue： 2  Page： 394-397  Publication year： Feb. 1999 
JST Material Number： F0699C  ISSN： 0916-8508  Document type： Article
Article type： 短報  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *file transfer ,...

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=99A0225529&from=J-GLOBAL&jstjournalNo=F0699C") }}

JST classification (2)： Basics of graph theory  (IA02020S) ,  Traffic theory  (ND02040C)

Reference (10)：

• KANEKO, Y. A synthesis of an optimal file transfer on a file transmission net. IEICE Trans. 1993, E76-A, 3, 377-386
• KANEKO, Y. A synthesis of a forest-type optimal file transfer on a file transmission net with source vertices. IEICE Trans. 1995, E78-A, 6, 671-679
• WONG, R. T. A dual ascent approach for Steiner tree problem on a directed graph. Mathematical Programming. 1984, 28, 271-287
• LIU, W. A lower bound for the Steiner tree problem in directed graphs. Networks. 1990, 20, 765-778
• IRI, M. Graph Theory with Exercise. 1983

Terms in the title (3)： ファイル転送 ,  問題 ,  複雑度