Recognizing Shrinkable Complexes Is NP-Complete - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Computational Geometry Year : 2016

Recognizing Shrinkable Complexes Is NP-Complete


We say that a simplicial complex is shrinkable if there exists a sequence of admissible edge contractions that reduces the complex to a single vertex. We prove that it is NP-complete to decide whether a (two-dimensional) simplicial complex is shrinkable. Along the way, we describe examples of contractible complexes that are not shrinkable.
Fichier principal
Vignette du fichier
jocg.pdf (4.29 Mo) Télécharger le fichier
Vignette du fichier
vignette.jpg (1.05 Mo) Télécharger le fichier
supplementary-material.pdf (9.83 Mo) Télécharger le fichier
vignette.pdf (1.05 Mo) Télécharger le fichier
Origin Files produced by the author(s)
Format Figure, Image

Dates and versions

hal-01384396 , version 1 (19-10-2016)
hal-01384396 , version 2 (05-03-2018)



Dominique Attali, Olivier Devillers, Marc Glisse, Sylvain Lazard. Recognizing Shrinkable Complexes Is NP-Complete. Journal of Computational Geometry, 2016, 7 (1), pp.430--443. ⟨10.20382/jocg.v7i1a18⟩. ⟨hal-01384396v2⟩
923 View
262 Download



Gmail Mastodon Facebook X LinkedIn More