Author

Author

Sort by: Order: Results:

  • Gupta, Manoj; Jain, Rahul; Modi, Nitiksha (Cornell University Library, 2020-05)
    One of the classical line of work in graph algorithms has been the Replacement Path Problem: given a graph G, s and t, find shortest paths from s to t avoiding each edge e on the shortest path from s to t. These paths are ...
  • Gupta, Manoj; Jain, Rahul; Modi, Nitiksha (03-08-20)

Search Digital Repository


Browse

My Account