Kuo-Hua Kao

Learn More
Given an edge-weighted undirected graph G and two prescribed vertices u and v, a next-to-shortest (u,v)-path is a shortest (u,v)-path amongst all (u,v)-paths having length strictly greater than the length of a shortest (u,v)-path. In this paper, we deal with the problem of computing a next-to-shortest (u,v)-path. We propose an ${\mathcal{O}}(n^{2})$ time(More)
KUO-HUA KAO, JOU-MING CHANG, YUE-LI WANG, SHUO-HONG XU AND JUSTIE SU-TZU JUAN Department of Computer Science and Information Engineering National Chi Nan University Nantou, 545 Taiwan Institute of Information and Decision Sciences National Taipei College of Business Taipei, 100 Taiwan Department of Information Management National Taiwan University of(More)
  • 1