The Weight-Constrained and Density-Constrained Path Problem and Related Problems in Trees
碩士 === 國立成功大學 === 資訊工程學系碩博士班 === 96 === Let $T = (V, E)$ be a tree of $n$ nodes in which each edge $e in E$ is associated with a pair $(v(e), w(e))$, where $v(e)$ is a real number that represents the {em value} of $e$ and $w(e)$ is a positive integer that represents the {em weight} of $e$. Given two...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/31041488965177390855 |