Zwick Uri

Uri Zwick

Information about the author Uri Zwick will soon be added to the site.
Found 5 papers in total
On Dynamic Shortest Paths Problems
On Dynamic Shortest Paths Problems
2011
We obtain the following results related to dynamic versions of the...
All‐Pairs Bottleneck Paths in Vertex Weighted Graphs
All‐Pairs Bottleneck Paths in Vertex Weighted Graphs
2011
Let G =( V , E , w ) be a directed graph, where w : V →ℝ is a weight...
Multicriteria global minimum cuts
Multicriteria global minimum cuts
2006
We consider two multicriteria versions of the global minimum cut problem in undirected...
A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths
A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths
2006
We present an O(n 3 √(log log n)/logn) -time algorithm for the All Pairs...
The smallest networks on which the Ford–Fulkerson maximum flow procedure may fail to terminate
The smallest networks on which the Ford–Fulkerson maximum flow procedure may fail to terminate
1995
It is widely known that the Ford–Fulkerson procedure for finding the maximum...
Papers per page: