Khanna Neelesh

Neelesh Khanna

Information about the author Neelesh Khanna will soon be added to the site.
Found 1 papers in total
Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs
2013
Let G =( V , E ) be an undirected unweighted graph. A path between any two vertices u...
Papers per page: