Computational Complexity Relationship between Compaction, Vertex-Compaction, and Retraction

Abstract In this paper, we show a very close relationship between the compaction, vertex-compaction, and retraction problems for reflexive and bipartite graphs. Similar to a long-standing open problem concerning whether the compaction and retraction problems are polynomially equivalent, the relationships that we present relate to our problems concerning whether the compaction and vertex-compaction problems are polynomially equivalent, and whether the vertex-compaction and retraction problems are polynomially equivalent. The relationships that we present also relate to the constraint satisfaction problem, providing evidence that similar to the compaction and retraction problems, it is also likely to be difficult to give a complete computational complexity classification of the vertex-compaction problem for every fixed reflexive or bipartite graph. In this paper, we however give a complete computational complexity classification of the vertex-compaction problem for all graphs, including even partially reflexive graphs, with four or fewer vertices, by giving proofs based on mostly just knowing the computational complexity classification results of the compaction problem for such graphs determined earlier by the author. Our results show that the compaction, vertex-compaction, and retraction problems are polynomially equivalent for every graph with four or fewer vertices.

[1]  Frank Harary,et al.  Graph Theory , 2016 .

[2]  Narayan Vikas,et al.  Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon , 2017, MFCS.

[3]  Narayan Vikas,et al.  Computational complexity of compaction to cycles , 1999, SODA '99.

[4]  Narayan Vikas,et al.  Algorithms for Partition of Some Class of Graphs under Compaction and Vertex-Compaction , 2011, Algorithmica.

[5]  P. Hell,et al.  Absolute Retracts and Varieties of Reflexive Graphs , 1987, Canadian Journal of Mathematics.

[6]  Eugene C. Freuder,et al.  The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..

[7]  Erwin Pesch,et al.  A characterization of absolute retracts of n-chromatic graphs , 1985, Discret. Math..

[8]  Pavol Hell,et al.  Graph partitions with prescribed patterns , 2014, Eur. J. Comb..

[9]  P. Hell,et al.  GRAPHS WITH FORBIDDEN HOMOMORPHIC IMAGES , 1979 .

[10]  Narayan Vikas,et al.  Computational complexity of compaction to irreflexive cycles , 2004, J. Comput. Syst. Sci..

[11]  Narayan Vikas,et al.  Compaction, Retraction, and Constraint Satisfaction , 2004, SIAM J. Comput..

[12]  Pavol Hell,et al.  List Homomorphisms and Circular Arc Graphs , 1999, Comb..

[13]  Sulamita Klein,et al.  List Partitions , 2003, SIAM J. Discret. Math..

[14]  Narayan Vikas.  Computational Complexity Relationship between Compaction, Vertex-Compaction, and Retraction , 2017, IWOCA.

[15]  Sulamita Klein,et al.  Complexity of graph partition problems , 1999, STOC '99.

[16]  Hans-Jürgen Bandelt,et al.  Absolute retracts of bipartite graphs , 1987, Discret. Appl. Math..

[17]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[18]  Tomás Feder,et al.  Monotone monadic SNP and constraint satisfaction , 1993, STOC.

[19]  Narayan Vikas,et al.  Computational Complexity Classification of Partition under Compaction and Retraction , 2004, COCOON.

[20]  NARAYAN VIKAS,et al.  Computational Complexity of Compaction to Reflexive Cycles , 2002, SIAM J. Comput..

[21]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[22]  Richard J. Nowakowski,et al.  Fixed-edge theorem for graphs with loops , 1979, J. Graph Theory.

[23]  Jaroslav Nesetril,et al.  On the complexity of H-coloring , 1990, J. Comb. Theory, Ser. B.

[24]  Pavol Hell,et al.  List Homomorphisms to Reflexive Graphs , 1998, J. Comb. Theory, Ser. B.

[25]  Narayan Vikas,et al.  Connected and Loosely Connected List Homomorphisms , 2002, WG.

[26]  Erwin Pesch,et al.  Retracts of graphs , 1988 .

[27]  Narayan Vikas,et al.  A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results , 2005, J. Comput. Syst. Sci..

[28]  Narayan Vikas.  Algorithms for Partition of Some Class of Graphs under Compaction and Vertex-Compaction , 2012, Algorithmica.

[29]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

[30]  Hans-Jürgen Bandelt,et al.  Absolute Reflexive Retracts and Absolute Bipartite Retracts , 1993, Discret. Appl. Math..