The power of linear-time data reduction for maximum matching (Q2211355): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Stony Brook / rank | |||
Normal rank | |||
Revision as of 12:56, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
