On the kernelization complexity of problems on graphs without long odd cycles (Q2914348)
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: On the kernelization complexity of problems on graphs without long odd cycles |
scientific article; zbMATH DE number 6086151
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the kernelization complexity of problems on graphs without long odd cycles |
scientific article; zbMATH DE number 6086151 |
Statements
On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles (English)
0 references
25 September 2012
0 references
0.7870603799819946
0 references
0.7846215963363647
0 references
0.7712280750274658
0 references
0.7516800165176392
0 references
0.7509676814079285
0 references
