Implementation of Maximum Independent Set Problem by Algorithmic Tile Self-Assembly

Zhen Cheng, Jian-hua Xiao
{"title":"Implementation of Maximum Independent Set Problem by Algorithmic Tile Self-Assembly","authors":"Zhen Cheng, Jian-hua Xiao","doi":"10.1109/BIC-TA.2011.36","DOIUrl":null,"url":null,"abstract":"The maximum independent set problem is a classic combinational optimization problem. Recently, algorithmic tile self-assembly is considered as a promising technique in nanotechnology. In this work, we show how the tile self-assembly process is used to implement the maximum independent set problem including three small systems: nondeterministic guess system, AND operation system and comparing system. Our method can be successfully performed this problem in ¦¨(mn) steps parallely and at very low cost, here n and m is the number of vertices and edges of the given graph.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BIC-TA.2011.36","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The maximum independent set problem is a classic combinational optimization problem. Recently, algorithmic tile self-assembly is considered as a promising technique in nanotechnology. In this work, we show how the tile self-assembly process is used to implement the maximum independent set problem including three small systems: nondeterministic guess system, AND operation system and comparing system. Our method can be successfully performed this problem in ¦¨(mn) steps parallely and at very low cost, here n and m is the number of vertices and edges of the given graph.
用算法块自组装实现最大独立集问题
最大独立集问题是一个经典的组合优化问题。近年来,算法自组装技术被认为是纳米技术中一种很有前途的技术。在这项工作中,我们展示了如何使用瓷砖自组装过程来实现最大独立集问题,包括三个小系统:不确定性猜测系统,和操作系统和比较系统。我们的方法可以在μ (mn)步中成功地并行执行这个问题,并且成本很低,这里n和m是给定图的顶点和边的数量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信