Luciene C. S. Motta

  • Citations Per Year
Learn More
Let G = (V ∪W,E) be an undirected graph, where V ∪W = {1, ..., n} is the vertex set and E = {(i, j) | i, j ∈ V ∪W, i < j} is the edge set. Vertex s = 1 is the source vertex, V is a set of vertices that might be visited, T ⊆ V is a set of vertices that must be visited (s ∈ T ), and W is a set of vertices that must be covered. A symmetric distance matrix C =(More)
  • 1