Art
J-GLOBAL ID：200902219188293348
Reference number：03A0714541
An Additional Adjacency between Two Levels in a Complete Binary Tree Minimizing Total Path Length.
総頂点間経路長を最小にする完全2分木の階層間隣接化
-
Publisher site
Copy service
{{ this.onShowCLink("http://jdream3.com/copy/?sid=JGLOBAL&noSystem=1&documentNoArray=03A0714541©=1") }}
-
Access JDreamⅢ for advanced search and analysis.
{{ this.onShowJLink("http://jdream3.com/lp/jglobal/index.html?docNo=03A0714541&from=J-GLOBAL&jstjournalNo=L1010A") }}
Author (1)：
Material：
Volume：
13
Issue：
3
Page：
353-360
Publication year：
Sep. 25, 2003
JST Material Number：
L1010A
ISSN：
0917-2246
Document type：
Article
Article type：
原著論文
Country of issue：
Japan (JPN)
Language：
JAPANESE (JA)
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.
,...
JST classification (1)：
JST classification
Category name(code) classified by JST.
Management engineering in general
Reference (16)：
-
AHO, A. V. Data Structures and Algorithms, Addison-Wesley. Reading, Mass. 1983
-
浅野孝夫. 情報の構造. 1994, 上
-
CORMEN, T. H. Introduction to Algorithms. 1990
-
ESWARAN, K. Augmentation problems. SIAM J. Computing. 1976, 5, 653-665
-
FRANK, A. Augmenting graphs to meet edge-connectivity requirements. SIAM J. Discrete Mathematics. 1992, 5, 25-53
ｍore...
Terms in the title (4)：
Terms in the title
Keywords automatically extracted from the title.
,
,
,
Return to Previous Page
