Parameterized complexity of connected even/odd subgraph problems (Q2904782)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6070922
| 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 6070922 |
Statements
23 August 2012
0 references
parameterized complexity
0 references
Euler graph
0 references
even graph
0 references
odd graph
0 references
treewidth
0 references
subgraph
0 references
Parameterized complexity of connected even/odd subgraph problems (English)
0 references
0.9908277988433838
0 references
0.9346182346343994
0 references
0.9330796003341676
0 references
0.8504939079284668
0 references
0.813450038433075
0 references
