A Linear-Time Algorithm for Constructinga Minimum Height Elimination Tree of a Tree
碩士 === 國立東華大學 === 資訊工程學系 === 90 === Given a graph, finding an optimal vertex ranking and constructing minimum height elimination trees are interesting computational problems. The problem of finding the minimum height elimination trees has been shown to be NP-hard on general graphs. An optimal vertex...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/79740931371464226752 |