19 citations · 31 across the 6 of their papers we have counts for
Showing 2011 · cs.DSShow all
3 papers · 2 filters
cs.DS2011★ 2 cited
A simpler and more efficient algorithm for the next-to-shortest path problem
Bang Ye Wu
Given an undirected graph with positive edge lengths and two vertices and , the next-to-shortest path problem is to find an -path which length is minimum among…
cs.DS2011★ 5 cited
Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs (With erratum)
Bang Ye Wu
For given a pair of nodes in a graph, the minimum non-separating path problem looks for a minimum weight path between the two nodes such that the remaining graph after removing the…
cs.DS2011★ 19 cited
The maximum disjoint paths problem on multi-relations social networks
Bang Ye Wu
Motivated by applications to social network analysis (SNA), we study the problem of finding the maximum number of disjoint uni-color paths in an edge-colored graph. We show the NP-…