When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2975721026 / rank | |||
Normal rank | |||
| Property / title | |||
When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (English) | |||
| Property / title: When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (English) / rank | |||
Normal rank | |||
Latest revision as of 10:25, 30 July 2024
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
