Art
J-GLOBAL ID：200902050939425682
Reference number：90A0207745
An efficient distributed algorithm for finding articulation points, bridges, and biconnected components in asynchronous networks.
非同期ネットワークにおける接合点,ブリッジ,及び双方向連結成分を見つけ出すための効率的分散型アルゴリズム
-
Publisher site
Copy service
{{ this.onShowCLink("http://jdream3.com/copy/?sid=JGLOBAL&noSystem=1&documentNoArray=90A0207745©=1") }}
-
Access JDreamⅢ for advanced search and analysis.
{{ this.onShowJLink("http://jdream3.com/lp/jglobal/index.html?docNo=90A0207745&from=J-GLOBAL&jstjournalNo=H0078D") }}
Author (2)：
,
Material：
Volume：
405
Page：
99-108
Publication year：
1989
JST Material Number：
H0078D
ISSN：
0302-9743
Document type：
Proceedings
Article type：
原著論文
Country of issue：
Germany, Federal Republic of (DEU)
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.
,...
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.
JST classification (1)：
JST classification
Category name(code) classified by JST.
Theory of computation
Terms in the title (6)：
Terms in the title
Keywords automatically extracted from the title.
,
,
,
,
,
Return to Previous Page
