Search: id:"swepub:oai:DiVA.org:liu-56791" >
Retractions To Pseu...
Retractions To Pseudoforests
-
- Feder, Tomas (author)
- Stanford University
-
- Hell, Pavol (author)
- Simon Fraser University
-
- Jonsson, Peter (author)
- Linköpings universitet,TCSLAB - Laboratoriet för teoretisk datalogi,Tekniska högskolan
-
show more...
-
- Krokhin, Andrei (author)
- University of Durham
-
- Nordh, Gustav (author)
- Linköpings universitet,TCSLAB - Laboratoriet för teoretisk datalogi,Tekniska högskolan
-
show less...
-
(creator_code:org_t)
- Society for Industrial and Applied Mathematics, 2010
- 2010
- English.
-
In: SIAM JOURNAL ON DISCRETE MATHEMATICS. - : Society for Industrial and Applied Mathematics. - 0895-4801 .- 1095-7146. ; 24:1, s. 101-112
- Related links:
-
http://theory.stanfo...
-
show more...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
show less...
Abstract
Subject headings
Close
- 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.
Keyword
- retraction
- computational complexity
- universal algebra
- constraint satisfaction
- TECHNOLOGY
- TEKNIKVETENSKAP
Publication and Content Type
- ref (subject category)
- art (subject category)
Find in a library
To the university's database