Parameterized complexity of connected Even/Odd subgraph problems

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 14, Issue , 2012, Pages 432-440

  Fomin, Fedor V ^a   Golovach, Petr A ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Euler graph; Even graph; Odd graph; Parameterized complexity; Treewidth

Indexed keywords

EULER GRAPHS; EVEN GRAPH; ODD GRAPH; PARAMETERIZED COMPLEXITY; TREE-WIDTH;

COMPUTER SCIENCE;

GRAPH THEORY;

EID: 84880253831     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2012.432     Document Type: Conference Paper

References (8)

1. Noga Alon, Raphael Yuster, and Uri Zwick. Color-coding. J. ACM, 42(4): 844-856, 1995.
2. Omid Amini, Fedor V. Fomin, and Saket Saurabh. Counting subgraphs via homomorphisms. In Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP 2009), volume 5555 of Lecture Notes Comp. Sci., pages 71-82. Springer, 2009.
3. Hans L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput., 25(6): 1305-1317, 1996.
4. Leizhen Cai and Boting Yang. Parameterized complexity of even/odd subgraph problems. J. Discrete Algorithms, 9(3): 231-240, 2011.
5. Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Ildikó Schlotter. Parameterized complexity of eulerian deletion problems. In Proceedings of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2011), volume 6986 of Lecture Notes Comp. Sci., pages 131-142. Springer, 2011.
6. Rodney G. Downey and Michael R. Fellows. Parameterized complexity. Monographs in Computer Science. Springer-Verlag, New York, 1999.
7. Jörg Flum and Martin Grohe. Parameterized complexity theory. Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag, Berlin, 2006.
8. Rolf Niedermeier. Invitation to fixed-parameter algorithms, volume 31 of Oxford Lecture Series in Mathematics and its Applications. Oxford University Press, Oxford, 2006.