识别可收缩复合物是np完全的

IF 0.4 Q4 MATHEMATICS Journal of Computational Geometry Pub Date : 2014-09-08 DOI:10.20382/jocg.v7i1a18

D. Attali, O. Devillers, M. Glisse, S. Lazard

{"title":"识别可收缩复合物是np完全的","authors":"D. Attali, O. Devillers, M. Glisse, S. Lazard","doi":"10.20382/jocg.v7i1a18","DOIUrl":null,"url":null,"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.","PeriodicalId":43044,"journal":{"name":"Journal of Computational Geometry","volume":"657 1","pages":"74-86"},"PeriodicalIF":0.4000,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Recognizing shrinkable complexes is NP-complete\",\"authors\":\"D. Attali, O. Devillers, M. Glisse, S. Lazard\",\"doi\":\"10.20382/jocg.v7i1a18\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":43044,\"journal\":{\"name\":\"Journal of Computational Geometry\",\"volume\":\"657 1\",\"pages\":\"74-86\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2014-09-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computational Geometry\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.20382/jocg.v7i1a18\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Geometry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.20382/jocg.v7i1a18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 6

摘要

如果存在一系列可容许的边收缩，使一个简单复合体缩减为单个顶点，则称该复合体是可收缩的。证明了判定一个(三维)简单复合体是否可收缩是np完全的。在此过程中，我们描述了一些不可收缩的可收缩复合物的例子。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

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 (three-dimensional) simplicial complex is shrinkable. Along the way, we describe examples of contractible complexes which are not shrinkable.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊