Derivatives Tree Problem
碩士 === 國立臺灣大學 === 商學研究所 === 95 === In this paper, we investigate the derivatives tree problem as well as design a linear time algorithm for solving it. In a derivatives tree, each vertex representing a derivative with a certain value is derived from its parent vertex. Initially given certain amount...
Main Authors: | Chun-Cheng Lin, 林春成 |
---|---|
Other Authors: | 游張松 |
Format: | Others |
Language: | en_US |
Published: |
2007
|
Online Access: | http://ndltd.ncl.edu.tw/handle/02331571987307036773 |
Similar Items
-
On the Popular Spanning Tree Problem
by: Wei-Cheng Lin, et al.
Published: (2016) -
Ambarzumyan problem on trees
by: Chien-Ru Lin, et al.
Published: (2008) -
On the clustered spanning tree problem
by: Lin, Chen-Wan, et al.
Published: (2017) -
Use Tree Derivation to Solve the Minimum Covering Problem
by: KANG-WEI YEN, et al.
Published: (2014) -
Spanning Tree Problems on Graph Classes
by: Ching-Chi Lin, et al.
Published: (2007)