Parameterized Complexity of Connected Even/Odd Subgraph Problems
type: Dataset
description: International audience
issued: 2026-05-25T03:36:14.472407
language: en
modified: 2026-05-25T03:36:14.472415
contact point: Organization
  fn: CCSD
keyword: conference-papers
keyword: euler-graph
keyword: even-graph
keyword: infoeu-reposemanticsconferenceobject
keyword: infoinfo-cccomputer-science-cscomputational-complexity-cscc
keyword: infoinfo-dscomputer-science-csdata-structures-and-algorithms-csds
keyword: odd-graph
keyword: parameterized-complexity
keyword: treewidth
landing page: Symposium on Theoretical Aspects of Computer Science

Parameterized Complexity of Connected Even/Odd Subgraph Problems
type: Distribution
format: HTML
issued: 2026-05-25T03:36:14.504729
modified: 2026-05-25T03:36:14.437354
access URL: https://hal.science/hal-00678168

test_moissonnage_selune
type: Agent