The Power of Linear-Time Data Reduction for Maximum Matching (Q5111261)
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: The Power of Linear-Time Data Reduction for Maximum Matching |
scientific article; zbMATH DE number 7204380
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Power of Linear-Time Data Reduction for Maximum Matching |
scientific article; zbMATH DE number 7204380 |
Statements
26 May 2020
0 references
maximum-cardinality matching
0 references
bipartite graphs
0 references
linear-time algorithms
0 references
kernelization
0 references
parameterized complexity analysis
0 references
FPT in P
0 references
0 references
0 references
The Power of Linear-Time Data Reduction for Maximum Matching (English)
0 references
0.9993411302566528
0 references
0.9052292108535768
0 references
0.801981508731842
0 references
0.7987343072891235
0 references
0.7895524501800537
0 references
