Parameterized complexity of even/odd subgraph problems (Q635735): Difference between revisions
From MaRDI portal
Latest revision as of 09:36, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Parameterized complexity of even/odd subgraph problems |
scientific article |
Statements
Parameterized complexity of even/odd subgraph problems (English)
0 references
23 August 2011
0 references
parameterized complexity
0 references
FPT algorithms
0 references
Eulerian graphs
0 references
even graphs
0 references
odd graphs
0 references
color-coding
0 references
random separation
0 references