When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165)
From MaRDI portal
scientific article; zbMATH DE number 7561510
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time |
scientific article; zbMATH DE number 7561510 |
Statements
21 July 2022
0 references
maximal independent set
0 references
maximal matching
0 references
sublinear-time algorithms
0 references
bounded neighborhood independence
0 references
0 references
0 references
When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (English)
0 references
