Parameterized Complexity of Weak Odd Domination Problems

David Cattanéo 1 Simon Perdrix 2, 1, 3
1 LIG Laboratoire d'Informatique de Grenoble - CAPP
LIG - Laboratoire d'Informatique de Grenoble
3 CARTE - Theoretical adverse computations, and safety
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00944652
Contributor : Nicolas Peltier <>
Submitted on : Monday, February 10, 2014 - 9:18:45 PM
Last modification on : Friday, October 25, 2019 - 1:28:38 AM

Links full text

Identifiers

Citation

David Cattanéo, Simon Perdrix. Parameterized Complexity of Weak Odd Domination Problems. 19th International Symposium on Fundamentals of Computation Theory, Aug 2013, Liverpool, United Kingdom. pp.107-120, ⟨10.1007/978-3-642-40164-0_13⟩. ⟨hal-00944652⟩

Share

Metrics

Record views

329