The power of linear-time data reduction for maximum matching (Q2211355)
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
| 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 |
Statements
The power of linear-time data reduction for maximum matching (English)
0 references
11 November 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
0.9993411302566528
0 references
0.9038036465644836
0 references
0.7999590635299683
0 references
0.7939066290855408
0 references
0.7855147123336792
0 references
