Parameterized Complexity of Connected Even/Odd Subgraph Problems (Q2904782): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| label / en | label / en | ||
Parameterized Complexity of Connected Even/Odd Subgraph Problems | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2012.432 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2266466481 / rank | |||
Normal rank | |||
| Property / title | |||
Parameterized Complexity of Connected Even/Odd Subgraph Problems (English) | |||
| Property / title: Parameterized Complexity of Connected Even/Odd Subgraph Problems (English) / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:02, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized Complexity of Connected Even/Odd Subgraph Problems |
scientific article |
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
