THE MOST HOMOGENEOUS SPANNING TREES
碩士 === 國立臺灣科技大學 === 管理技術研究所 === 83 ===
Main Authors: | Lv, Xing-Juan, 呂幸娟 |
---|---|
Other Authors: | Zhang, Rui-Xiong |
Format: | Others |
Language: | zh-TW |
Published: |
1995
|
Online Access: | http://ndltd.ncl.edu.tw/handle/91445352951293361959 |
Similar Items
-
Finding the most vital edge with respect to minimum spanning trees in weighted graphs
by: JIN, DIAO-MING, et al.
Published: (1992) -
Self-stabilizing algorithm - Finding the most vital edge in the minimum spanning tree
by: Chi-Yuan Lo, et al.
Published: (2008) -
Finding the most vital edge with respect to minimum spanning tree in weighted graphs
by: LI,YU-QI, et al.
Published: (1991) -
An Efficient Parallel Algorithm for Constructing a Spanning Tree on Trapezoid Graph
by: Cai, Xing-Yi, et al.
Published: (1996) -
Spanning Trees with At Most 6 Leaves in K1,5-Free Graphs
by: Pei Sun, et al.
Published: (2019-01-01)