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

Sepehr Assadi, Shay Solomon. When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time. In Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, Stefano Leonardi, editors, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece. Volume 132 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.