Recognizing shrinkable complexes is NP-complete

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":"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}
引用次数: 6

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
识别可收缩复合物是np完全的
如果存在一系列可容许的边收缩,使一个简单复合体缩减为单个顶点,则称该复合体是可收缩的。证明了判定一个(三维)简单复合体是否可收缩是np完全的。在此过程中,我们描述了一些不可收缩的可收缩复合物的例子。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
0.70
自引率
33.30%
发文量
0
审稿时长
52 weeks
期刊最新文献
Hyperplane separability and convexity of probabilistic point sets On the complexity of minimum-link path problems Hyperorthogonal well-folded Hilbert curves Approximability of the discrete Fréchet distance Shortest path to a segment and quickest visibility queries
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1