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: | Ku ,Shuang-Yi, 辜雙儀 |
---|---|
Other Authors: | Tung, Shih Ping |
Format: | Others |
Language: | zh-TW |
Published: |
1996
|
Online Access: | http://ndltd.ncl.edu.tw/handle/04496873079818106039 |
Similar Items
-
A Genetic Algorithm for the Double Digest Problem
by: Sheng-Hung Yi, et al.
Published: (2003) -
Quantum Inspired Genetic Algorithm for Double Digest Problem
by: Jingwen Suo, et al.
Published: (2020-01-01) -
A Genetic Algorithm on PC-Clusters for the Double Digest Problem
by: Tseng Liang-Chia, et al.
Published: (2003) -
Algorithms for Location Problems on Trees
by: Shan-Chyun Ku, et al.
Published: (2001) -
Solving the TRA’s Conductor Scheduling Problem by Genetic Algorithms and Ant Colony Optimization
by: 劉雙火
Published: (2006)