Algorithms for Double Digest Problem
碩士 === 中原大學 === 應用數學研究所 === 84 === For solving double digest problem (DDP), Shih-Ping Tung suggests an algorithm, which first constructs a bicolor double digest graph, then finds alternating Hamiltonian paths on it. Each alternating...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1996
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/04496873079818106039 |