Efficient Algorithms for Some Problems on Subclasses of Chordal Graphs
碩士 === 國立中正大學 === 資訊工程研究所 === 82 === Two problems are discussed in this thesis. One is the all pairs shortest paths problem, and the other is the minimum weight k dominating sets problem. The all pairs shortest paths problem is applied exte...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1994
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/25117474535146377267 |