首页 > 最新文献

Frontiers in Algorithmics最新文献

英文 中文
A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan 最小化最大完工时间的多个平行相同多阶段流水作业的PTAS
Pub Date : 2016-06-30 DOI: 10.1007/978-3-319-39817-4_22
Weitian Tong, Eiji Miyano, R. Goebel, Guohui Lin
{"title":"A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan","authors":"Weitian Tong, Eiji Miyano, R. Goebel, Guohui Lin","doi":"10.1007/978-3-319-39817-4_22","DOIUrl":"https://doi.org/10.1007/978-3-319-39817-4_22","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"206 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121529615","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles? 断点图可以被分解成2圈吗?
Pub Date : 2016-06-30 DOI: 10.1007/978-3-319-39817-4_20
Lianrong Pu, Haitao Jiang
{"title":"Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles?","authors":"Lianrong Pu, Haitao Jiang","doi":"10.1007/978-3-319-39817-4_20","DOIUrl":"https://doi.org/10.1007/978-3-319-39817-4_20","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121863013","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Empirical Study of Phase Transition of Hamiltonian Cycle Problem in Random Graphs with Degrees Greater Than One 度大于1的随机图中哈密顿循环问题相变的实证研究
Pub Date : 2016-06-30 DOI: 10.1007/978-3-319-39817-4_19
Wei Peng, Dongxia Wang, Xinwen Jiang
{"title":"Empirical Study of Phase Transition of Hamiltonian Cycle Problem in Random Graphs with Degrees Greater Than One","authors":"Wei Peng, Dongxia Wang, Xinwen Jiang","doi":"10.1007/978-3-319-39817-4_19","DOIUrl":"https://doi.org/10.1007/978-3-319-39817-4_19","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125949439","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Finding Disjoint Dense Clubs in an Undirected Graph 求无向图中不相交的密集俱乐部
Pub Date : 2016-06-30 DOI: 10.1007/978-3-319-39817-4_27
Peng Zou, Hui Li, C. Xin, Wencheng Wang, B. Zhu
{"title":"Finding Disjoint Dense Clubs in an Undirected Graph","authors":"Peng Zou, Hui Li, C. Xin, Wencheng Wang, B. Zhu","doi":"10.1007/978-3-319-39817-4_27","DOIUrl":"https://doi.org/10.1007/978-3-319-39817-4_27","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124754428","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Positive Zero Forcing and Edge Clique Coverings 正零强迫和边缘集团覆盖
Pub Date : 2016-06-30 DOI: 10.1007/978-3-319-39817-4_6
Shaun M. Fallat, Karen Meagher, Abolghasem Soltani, Boting Yang
{"title":"Positive Zero Forcing and Edge Clique Coverings","authors":"Shaun M. Fallat, Karen Meagher, Abolghasem Soltani, Boting Yang","doi":"10.1007/978-3-319-39817-4_6","DOIUrl":"https://doi.org/10.1007/978-3-319-39817-4_6","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127629856","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs 区间图内顶点数最大生成树的多项式时间算法
Pub Date : 2016-06-30 DOI: 10.1007/978-3-319-39817-4_10
Xingfu Li, Haodi Feng, Haitao Jiang, B. Zhu
{"title":"A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs","authors":"Xingfu Li, Haodi Feng, Haitao Jiang, B. Zhu","doi":"10.1007/978-3-319-39817-4_10","DOIUrl":"https://doi.org/10.1007/978-3-319-39817-4_10","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128347551","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Breaking Cycle Structure to Improve Lower Bound for Max-SAT 改进Max-SAT下界的破环结构
Pub Date : 2016-06-30 DOI: 10.1007/978-3-319-39817-4_12
Yanli Liu, Chumin Li, Kun He, Yi Fan
{"title":"Breaking Cycle Structure to Improve Lower Bound for Max-SAT","authors":"Yanli Liu, Chumin Li, Kun He, Yi Fan","doi":"10.1007/978-3-319-39817-4_12","DOIUrl":"https://doi.org/10.1007/978-3-319-39817-4_12","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128367951","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Parallel Identifying (l, d)-Motifs in Biosequences Using CPU and GPU Computing 利用CPU和GPU计算并行识别生物序列中的(1,d)-基序
Pub Date : 2016-06-30 DOI: 10.1007/978-3-319-39817-4_25
Cheng Zhong, Jing Zhang, Bei Hua, Feng Yang, Zhengping Liu
{"title":"Parallel Identifying (l, d)-Motifs in Biosequences Using CPU and GPU Computing","authors":"Cheng Zhong, Jing Zhang, Bei Hua, Feng Yang, Zhengping Liu","doi":"10.1007/978-3-319-39817-4_25","DOIUrl":"https://doi.org/10.1007/978-3-319-39817-4_25","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131741971","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
How to Block Blood Flow by Using Elastic Coil 如何使用弹性线圈阻断血液流动
Pub Date : 2016-06-30 DOI: 10.1007/978-3-319-39817-4_4
Zihe Chen, Danyang Chen, Xiangyu Wang, Jianping Xiang, H. Meng, Jinhui Xu
{"title":"How to Block Blood Flow by Using Elastic Coil","authors":"Zihe Chen, Danyang Chen, Xiangyu Wang, Jianping Xiang, H. Meng, Jinhui Xu","doi":"10.1007/978-3-319-39817-4_4","DOIUrl":"https://doi.org/10.1007/978-3-319-39817-4_4","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123832558","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Kernelization of Two Path Searching Problems on Split Graphs 分割图上两条路径搜索问题的核化
Pub Date : 2016-06-30 DOI: 10.1007/978-3-319-39817-4_23
Yongjie Yang, Y. Shrestha, Wenjun Li, Jiong Guo
{"title":"Kernelization of Two Path Searching Problems on Split Graphs","authors":"Yongjie Yang, Y. Shrestha, Wenjun Li, Jiong Guo","doi":"10.1007/978-3-319-39817-4_23","DOIUrl":"https://doi.org/10.1007/978-3-319-39817-4_23","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114850940","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
期刊
Frontiers in Algorithmics
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
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