A Study of End-to-end Longest Path Problem on One-hole Meshes
碩士 === 國立東華大學 === 資訊工程學系 === 102 === The longest path problem is a classic problem which is to find a simple path in a given graph which contains the maximum number of vertices. The end-to-end longest path problem is to find the longest path between the given start and end vertices. A mesh is a rect...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/5nbm8r |