When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear-Time

Cited by: 0|Bibtex|Views15
Other Links: arxiv.org

Abstract:

Maximal independent set (MIS), maximal matching (MM), and $(\Delta+1)$-coloring in graphs of maximum degree $\Delta$ are among the most prominent algorithmic graph theory problems. They are all solvable by a simple linear-time greedy algorithm and up until very recently this constituted the state-of-the-art. In SODA 2019, Assadi, Chen, ...More

Code:

Data:

Your rating :
0

 

Tags
Comments