Parameterized Complexity of Connected Even/Odd Subgraph Problems
Data and Resources
Additional Info
| Field | Value |
|---|---|
| Source | Symposium on Theoretical Aspects of Computer Science |
| Author | Fomin, Fedor V., Golovach, Petr A. |
| Maintainer | CCSD |
| Last Updated | May 25, 2026, 03:36 (UTC) |
| Created | May 25, 2026, 03:36 (UTC) |
| Identifier | hal-00678168 |
| Language | en |
| Rights | https://about.hal.science/hal-authorisation-v1/ |
| contributor | Department of Informatics [Bergen] (UiB) ; University of Bergen (UiB) |
| coverage | Paris, France |
| creator | Fomin, Fedor V. |
| date | 2012-02-29T00:00:00 |
| harvest_object_id | ff64d7a6-51b5-4cd4-a0f3-ede952c7dad5 |
| harvest_source_id | 3374d638-d20b-4672-ba96-a23232d55657 |
| harvest_source_title | test moissonnage SELUNE |
| metadata_modified | 2025-02-13T00:00:00 |
| set_spec | type:COMM |