Faster fixed-parameter tractable algorithms for matching and packing problems (Q958209)
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: Faster fixed-parameter tractable algorithms for matching and packing problems |
scientific article; zbMATH DE number 5377140
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster fixed-parameter tractable algorithms for matching and packing problems |
scientific article; zbMATH DE number 5377140 |
Statements
Faster fixed-parameter tractable algorithms for matching and packing problems (English)
0 references
2 December 2008
0 references
parameterized complexity
0 references
fixed parameter tractable
0 references
graph matching
0 references
set packing
0 references
color coding
0 references
0.9134579
0 references
0.9134579
0 references
0.9091747
0 references
0.9081658
0 references
0.9079851
0 references
0.9077502
0 references
0.9074402
0 references
0.9074402
0 references
