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

Other

Sepehr Assadi and Shay Solomon

Leibniz International Proceedings in Informatics, LIPIcs, Vol.132

Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany

01/01/2019

Abstract

Computer Science

20 Record Views

Title: When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time
Creators: Sepehr Assadi
Shay Solomon
Publication Details: Leibniz International Proceedings in Informatics, LIPIcs, Vol.132
Date published: 01/01/2019
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany
Academic Unit: Computer Science (SAS)
Language: English
Resource Type: Other
Identifiers: 991031654792104646