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 (three-dimensional) simplicial complex is shrinkable. Along the way, we describe examples of contractible complexes which are not shrinkable. © 2014 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Attali, D., Devillers, O., Glisse, M., & Lazard, S. (2014). Recognizing shrinkable complexes is NP-complete. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8737 LNCS, pp. 74–86). Springer Verlag. https://doi.org/10.1007/978-3-662-44777-2_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
