The following pages link to Surender Baswana (Q666656):
Displaying 22 items.
- An efficient strongly connected components algorithm in the fault tolerant model (Q666658) (← links)
- Streaming algorithm for graph spanners-single pass and constant processing time per edge (Q963343) (← links)
- All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time (Q1001904) (← links)
- Fault tolerant reachability for directed graphs (Q1664162) (← links)
- Planar graph blocking for external searching (Q1849382) (← links)
- Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs (Q1949751) (← links)
- Fault tolerant depth first search in undirected graphs: simple yet efficient (Q2149103) (← links)
- Mincut sensitivity data structures for the insertion of an edge (Q2165037) (← links)
- Incremental algorithm for maintaining a DFS tree for undirected graphs (Q2408922) (← links)
- Randomization for Efficient Dynamic Graph Algorithms (Q2795930) (← links)
- (Q2921727) (← links)
- Approximate distance oracles for unweighted graphs in expected <i>O</i> ( <i>n</i> <sup>2</sup> ) time (Q2944530) (← links)
- On Dynamic DFS Tree in Directed Graphs (Q2946380) (← links)
- (Q2957502) (← links)
- Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs (Q3113776) (← links)
- Additive spanners and (α, β)-spanners (Q3188987) (← links)
- Fully dynamic randomized algorithms for graph spanners (Q3189078) (← links)
- Dynamic DFS in Undirected Graphs: breaking the O(<i>m</i>) barrier (Q4575631) (← links)
- (Q5092428) (← links)
- (Q5111403) (← links)
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs (Q5297139) (← links)
- Mincut Sensitivity Data Structures for the Insertion of an Edge (Q5874478) (← links)
