Parameterized complexity of maximum edge colorable subgraph (Q2088595)
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: Parameterized complexity of maximum edge colorable subgraph |
scientific article; zbMATH DE number 7596613
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity of maximum edge colorable subgraph |
scientific article; zbMATH DE number 7596613 |
Statements
Parameterized complexity of maximum edge colorable subgraph (English)
0 references
6 October 2022
0 references
edge coloring
0 references
kernelization
0 references
FPT algorithms
0 references
kernel lower bound
0 references
0.99013376
0 references
0.93992037
0 references
0.9282086
0 references
0.9282086
0 references
0.92615134
0 references
0.9255371
0 references
0.9220201
0 references
0.9183307
0 references
0.91797256
0 references
