A study on lower bound of direct proportional length-based DNA computing for shortest path problem
Previously, we proposed a direct proportional length-based DNA computing approach for weighted graph problem. The approach has been proposed essentially to overcome the shortcoming of constant proportional length-based DNA computing approach. However, by using this approach, the minimum weight of ed...
Disimpan dalam:
| Pengarang-pengarang Utama: | , , , |
|---|---|
| Pengarang-pengarang Lain: | |
| Format: | Book Section |
| Diterbitkan: |
Springer
2005
|
| Subjek-subjek: | |
| Capaian Atas Talian: | http://eprints.utm.my/7164/ http://eprints.utm.my/7164/ http://eprints.utm.my/7164/ |
| Penanda-penanda: |
Tambah Penanda
Tiada Penanda, Jadilah orang pertama menanda rekod ini!
|
Jadilah orang pertama meninggalkan komen!