An estimator for matching size in low arboricity graphs with two applications (Q2106871)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An estimator for matching size in low arboricity graphs with two applications |
scientific article; zbMATH DE number 7625357
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An estimator for matching size in low arboricity graphs with two applications |
scientific article; zbMATH DE number 7625357 |
Statements
An estimator for matching size in low arboricity graphs with two applications (English)
0 references
29 November 2022
0 references
maximum matching
0 references
approximation algorithms
0 references
data stream algorithms
0 references
0 references
0 references
0.8724427223205566
0 references
0.8723231554031372
0 references
0.8620555996894836
0 references
0.8493944406509399
0 references
0.8351759910583496
0 references
