A Study of the Longest Path Problem on Meshes with one Convex Hole
碩士 === 國立東華大學 === 資訊工程學系 === 104 === The longest path problem is a famous problem in the field of graph theory. The task is to find a path in a given graph such that the path traverses through as many vertices as possible. A rectangular grid graph, also called a mesh, denoted as R(m,n) is a graph with...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/60725846787350382293 |