No. Title Author Year
1 Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient Baswana, Surender et al. 2019
2 An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model Baswana, Surender et al. 2017
3 Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs Anand, Abhash et al. 2012
4 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: 4


DROPS-Home | Imprint | Privacy Published by LZI