A study on recognizing spanning trees
博士 === 國立清華大學 === 資訊科學學系 === 82 === There are several kinds of spanning trees we are concerned about : (1) A depth-first-search tree is a by-product of a depth first search algorithm; (2) A breadth-first-search tree is a by-product of a breadth first sea...
Main Authors: | Peng, Chen Hsing, 彭振興 |
---|---|
Other Authors: | R. C. T. Lee; Jia-Shung Wang |
Format: | Others |
Language: | en_US |
Published: |
1994
|
Online Access: | http://ndltd.ncl.edu.tw/handle/27981076042423823113 |
Similar Items
-
spanning trees of graphs
by: yie yiesh you, et al.
Published: (2001) -
On the clustered spanning tree problem
by: Lin, Chen-Wan, et al.
Published: (2017) -
A study on constructing labeled trees and spanning trees
by: 陳宏昌
Published: (1997) -
Comparative Study of SWST (Simple Weighted Spanning Tree) and EAST (Energy Aware Spanning Tree)
by: Lifford McLauchlan, et al.
Published: (2014-08-01) -
A study on weighted degree spanning trees
by: Yen-Ying Tang, et al.
Published: (2009)