No. Title Author Year
1 Minimum+1 (s,t)-cuts and Dual Edge Sensitivity Oracle Baswana, Surender et al. 2022
2 Mincut Sensitivity Data Structures for the Insertion of an Edge Baswana, Surender et al. 2020
3 Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient Baswana, Surender et al. 2019
4 An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model Baswana, Surender et al. 2017
5 Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs Anand, Abhash et al. 2012
6 Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs Khanna, Neelesh et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 6

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI