"Parameterized complexity of even/odd subgraph problems."

Leizhen Cai, Boting Yang (2011)

> Home

Details and statistics

DOI: 10.1016/J.JDA.2011.03.004

access: open

type: Journal Article

metadata version: 2023-08-28

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jda/CaiY11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/CaiY11
Leizhen Cai, Boting Yang:
Parameterized complexity of even/odd subgraph problems. J. Discrete Algorithms 9(3): 231-240 (2011)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.