Parameterized complexity of connected even/odd subgraph problems (Q395000)
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 connected even/odd subgraph problems |
scientific article; zbMATH DE number 6251116
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of connected even/odd subgraph problems |
scientific article; zbMATH DE number 6251116 |
Statements
Parameterized complexity of connected even/odd subgraph problems (English)
0 references
28 January 2014
0 references
parameterized complexity
0 references
Euler graph
0 references
even graph
0 references
odd graph
0 references
treewidth
0 references
0.99999964
0 references
0.9780065
0 references
0.9780065
0 references
0.94434524
0 references
0.9364743
0 references
0.92836714
0 references
0.91616344
0 references
0 references
0.90626156
0 references
