Recognizing Shrinkable Complexes Is NP-Complete
Abstract
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.
Domains
Computational Geometry [cs.CG]
Fichier principal
jocg.pdf (4.29 Mo)
Télécharger le 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 |
|---|
Loading...