发现好书期刊，享受阅读乐趣

海量图书期刊资源，随时随地畅享阅读乐趣

A new algorithm for minimum spanning tree using depth-first-search in an undirected graph

A new algorithm for minimum spanning tree using depth-first-search in an undirected graph

Salehi-Fathabadi, H.; Ahrabian, H.

期刊名称International Journal of Computer Mathematics
作者Salehi-Fathabadi, H.; Ahrabian, H.
卷第57卷
印刷ISSN0020-7160
电子ISSN1029-0265
文件大小275.96KB
发表时间1995-01
DOI10.1080/00207169508804419
页码157-161

← 返回【学霸图书馆】主页