liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Retractions To Pseudoforests
Stanford University.
Simon Fraser University.
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
University of Durham.
Show others and affiliations
2010 (English)In: SIAM JOURNAL ON DISCRETE MATHEMATICS, ISSN 0895-4801, Vol. 24, no 1, 101-112 p.Article in journal (Refereed) Published
Abstract [en]

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 based mainly on algebraic techniques from universal algebra that previously have been used for analyzing the complexity of constraint satisfaction problems.

Place, publisher, year, edition, pages
Society for Industrial and Applied Mathematics , 2010. Vol. 24, no 1, 101-112 p.
Keyword [en]
retraction, computational complexity, universal algebra, constraint satisfaction
National Category
Engineering and Technology
URN: urn:nbn:se:liu:diva-56791DOI: 10.1137/080738866ISI: 000277834800007OAI: diva2:322279
Available from: 2010-06-04 Created: 2010-06-04 Last updated: 2012-08-23

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Jonsson, PeterNordh, Gustav
By organisation
TCSLAB - Theoretical Computer Science LaboratoryThe Institute of Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 40 hits
ReferencesLink to record
Permanent link

Direct link