Art
J-GLOBAL ID：200902015674658027   Reference number：88A0094269

An algorithm for finding minimum spanning trees with a degree constraint.

次数制限付き最小木を求めるアルゴリズム
Author (1)：
MATSUSHITA HIROAKI

About MATSUSHITA HIROAKI

(詫間電波工高専)

About 詫間電波工高専


Material：
詫間電波工業高等専門学校研究紀要  (Bulletin of Takuma National College of Technology)

About 詫間電波工業高等専門学校研究紀要


Issue： 15  Page： 135-143  Publication year： Nov. 1987 
JST Material Number： X0496A  ISSN： 0388-2926  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.
tree(graph)

About tree(graph)

,...
   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=88A0094269&from=J-GLOBAL&jstjournalNo=X0496A") }}
JST classification (2)：
JST classification
Category name(code) classified by JST.
Basics of graph theory 
(IA02020S)

About Basics of graph theory

,  Numerical computation 
(JE02000J)

About Numerical computation

Terms in the title (4)：
Terms in the title
Keywords automatically extracted from the title.
次数

About 次数

, 
制限

About 制限

, 
最小木

About 最小木

, 
アルゴリズム

About アルゴリズム


Return to Previous Page

TOP

BOTTOM