Compaction, Retraction, and Constraint Satisfaction

Authors:
Narayan Vikas
Affiliations:
-
Venue:
SIAM Journal on Computing
Year:
2004

Citing 0
Cited 7

A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results

Journal of Computer and System Sciences
Retractions to Pseudoforests

SIAM Journal on Discrete Mathematics
Computing vertex-surjective homomorphisms to partially reflexive trees

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Algorithms for partition of some class of graphs under compaction

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
The computational complexity of disconnected cut and 2K2-partition

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The complexity of surjective homomorphism problems-a survey

Discrete Applied Mathematics
Computing vertex-surjective homomorphisms to partially reflexive trees

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we show a very close relationship among the compaction, retraction, and constraint satisfaction problems in the context of reflexive and bipartite graphs. The compaction and retraction problems are special graph coloring problems, and the constraint satisfaction problem is well known to have an important role in artificial intelligence. The relationships we present provide evidence that, similar to %as for the retraction problem, it is likely to be difficult to determine whether for every fixed reflexive or bipartite graph, the compaction problem is polynomial time solvable or NP-complete. In particular, the relationships that we present relate to a long-standing open problem concerning the equivalence of the compaction and retraction problems.