The Next-to-Shortest Path Problem in Graphs
博士 === 國立暨南國際大學 === 資訊工程學系 === 98 === Given an edge-weighted graph $G=(V,E,w)$ with two prescribed vertices $u$ and $v$, finding a shortest path from $u$ to $v$ is a classic problem in graph theory. An interesting variation of the shortest path problem is to find a next-to-shortest path from $u$ to...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/08917498716992523332 |