Retractions to Pseudoforests

For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops allowed) where each connected component has at most one cycle, i.e., a pseudoforest. In particular, this result extends the known complexity classifications of Ret(H) for reflexive and irreflexive cycles to general cycles. Our approach is mainly based on algebraic techniques from universal algebra that have previously been used for analyzing the complexity of constraint satisfaction problems. Key words. Retraction, Computational Complexity, Universal Algebra, Constraint Satisfaction AMS subject classifications. 05C15, 08A70, 68R10

• Type: Journal
• Year: 2010
• Where: SIAMDM
• Authors: Tomás Feder, Pavol Hell, Peter Jonsson, Andrei A. Krokhin, Gustav Nordh
• Keywords: Constraint Satisfaction, Constraint Satisfaction Problems, SIAMDM 2010, Universal Algebra