Parameterized complexity of connected even/odd subgraph problems (Q395000): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C45 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6251116 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
parameterized complexity | |||
| Property / zbMATH Keywords: parameterized complexity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Euler graph | |||
| Property / zbMATH Keywords: Euler graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
even graph | |||
| Property / zbMATH Keywords: even graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
odd graph | |||
| Property / zbMATH Keywords: odd graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
treewidth | |||
| Property / zbMATH Keywords: treewidth / rank | |||
Normal rank | |||
Revision as of 16:03, 29 June 2023
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
