The power of linear-time data reduction for maximum matching (Q2211355): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 06:18, 5 March 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
