Parameterized complexity of connected even/odd subgraph problems (Q395000): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q60488404, #quickstatements; #temporary_batch_1711196317277 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q60488404 / rank | |||
Normal rank | |||
Revision as of 14:23, 23 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity of connected even/odd subgraph problems |
scientific article |
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
