Yunus Can Bilge

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
All Colors Shortest Path problem defined on an undirected graph aims at finding a shortest, possibly non-simple, path where every color occurs at least once, assuming that each vertex in the graph is associated with a color known in advance. To the best of our knowledge, this paper is the first to define and investigate this problem. Even though the problem(More)
  • 1