Parameterized complexity of even/odd subgraph problems (Q635735): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q114162510, #quickstatements; #temporary_batch_1710865376617 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jda.2011.03.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2035543139 / rank | |||
Normal rank | |||
Revision as of 22:00, 19 March 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
