No. Title Author Year
1 When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time Assadi, Sepehr et al. 2019
2 Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier Charikar, Moses et al. 2018
3 Fully Dynamic MIS in Uniformly Sparse Graphs Onak, Krzysztof et al. 2018
4 Improved Dynamic Graph Coloring Solomon, Shay et al. 2018
5 Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs Solomon, Shay 2018
Current Page :
Number of result pages: 1
Number of documents: 5


DROPS-Home | Imprint | Privacy Published by LZI