发布求助
文献互助 智能选刊 最新文献

Frontiers in Algorithmics最新文献

筛选
英文 中文
Two Kinds of Generalized 3-Connectivities of Alternating Group Networks 交替群网络的两种广义3-连通性
Frontiers in Algorithmics Pub Date : 2018-05-08 DOI: 10.1007/978-3-319-78455-7_1
Jou-Ming Chang, Kung-Jui Pai, Jinn-Shyong Yang, Ro-Yu Wu
{"title":"Two Kinds of Generalized 3-Connectivities of Alternating Group Networks","authors":"Jou-Ming Chang, Kung-Jui Pai, Jinn-Shyong Yang, Ro-Yu Wu","doi":"10.1007/978-3-319-78455-7_1","DOIUrl":"https://doi.org/10.1007/978-3-319-78455-7_1","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133371319","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}
引用次数: 12
Guarding Polyhedral Terrain by k-Watchtowers 守卫多面体地形的k-瞭望塔
Frontiers in Algorithmics Pub Date : 2018-05-08 DOI: 10.1007/978-3-319-78455-7_9
Nitesh Tripathi, Manjish Pal, Minati De, G. Das, S. Nandy
{"title":"Guarding Polyhedral Terrain by k-Watchtowers","authors":"Nitesh Tripathi, Manjish Pal, Minati De, G. Das, S. Nandy","doi":"10.1007/978-3-319-78455-7_9","DOIUrl":"https://doi.org/10.1007/978-3-319-78455-7_9","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126260478","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
The Maximum Distance-d Independent Set Problem on Unit Disk Graphs 单位磁盘图上的最大距离-d独立集问题
Frontiers in Algorithmics Pub Date : 2018-05-08 DOI: 10.1007/978-3-319-78455-7_6
S. Jena, Ramesh K. Jallu, G. Das, S. Nandy
{"title":"The Maximum Distance-d Independent Set Problem on Unit Disk Graphs","authors":"S. Jena, Ramesh K. Jallu, G. Das, S. Nandy","doi":"10.1007/978-3-319-78455-7_6","DOIUrl":"https://doi.org/10.1007/978-3-319-78455-7_6","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129071861","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
Improved Kernels for Several Problems on Planar Graphs 平面图上若干问题的改进核算法
Frontiers in Algorithmics Pub Date : 2018-05-08 DOI: 10.1007/978-3-319-78455-7_13
Qilong Feng, Beilin Zhuo, Guanlan Tan, Neng Huang, Jian-xin Wang
{"title":"Improved Kernels for Several Problems on Planar Graphs","authors":"Qilong Feng, Beilin Zhuo, Guanlan Tan, Neng Huang, Jian-xin Wang","doi":"10.1007/978-3-319-78455-7_13","DOIUrl":"https://doi.org/10.1007/978-3-319-78455-7_13","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"371 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116567267","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
On the Minmax Regret Path Center Problem on Trees 关于树的最小最大后悔路径中心问题
Frontiers in Algorithmics Pub Date : 2018-05-08 DOI: 10.1007/978-3-319-78455-7_4
Biing-Feng Wang, Jhih-Hong Ye, Chih-Yu Li
{"title":"On the Minmax Regret Path Center Problem on Trees","authors":"Biing-Feng Wang, Jhih-Hong Ye, Chih-Yu Li","doi":"10.1007/978-3-319-78455-7_4","DOIUrl":"https://doi.org/10.1007/978-3-319-78455-7_4","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114419991","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
Parameterized Algorithms for Minimum Tree Cut/Paste Distance and Minimum Common Integer Partition 最小树切/粘贴距离和最小公共整数分割的参数化算法
Frontiers in Algorithmics Pub Date : 2018-05-08 DOI: 10.1007/978-3-319-78455-7_8
Jie You, Jian-xin Wang, Qilong Feng
{"title":"Parameterized Algorithms for Minimum Tree Cut/Paste Distance and Minimum Common Integer Partition","authors":"Jie You, Jian-xin Wang, Qilong Feng","doi":"10.1007/978-3-319-78455-7_8","DOIUrl":"https://doi.org/10.1007/978-3-319-78455-7_8","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"221 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134496134","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}
引用次数: 4
Single Vehicle's Package Delivery Strategy with Online Traffic Congestion of Certain Delay Time 具有一定延迟时间的在线交通拥堵情况下的单车辆包裹递送策略
Frontiers in Algorithmics Pub Date : 2018-05-08 DOI: 10.1007/978-3-319-78455-7_16
Songhua Li, Yinfeng Xu
{"title":"Single Vehicle's Package Delivery Strategy with Online Traffic Congestion of Certain Delay Time","authors":"Songhua Li, Yinfeng Xu","doi":"10.1007/978-3-319-78455-7_16","DOIUrl":"https://doi.org/10.1007/978-3-319-78455-7_16","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121894050","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
Exact Algorithms for Allocation Problems 分配问题的精确算法
Frontiers in Algorithmics Pub Date : 2018-05-08 DOI: 10.1007/978-3-319-78455-7_19
Sundar Annamalai, N. Narayanaswamy
{"title":"Exact Algorithms for Allocation Problems","authors":"Sundar Annamalai, N. Narayanaswamy","doi":"10.1007/978-3-319-78455-7_19","DOIUrl":"https://doi.org/10.1007/978-3-319-78455-7_19","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122592318","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
The Complexity of Weak Consistency 弱一致性的复杂性
Frontiers in Algorithmics Pub Date : 2018-05-08 DOI: 10.1007/978-3-319-78455-7_17
Gaoang Liu, Xiuying Liu
{"title":"The Complexity of Weak Consistency","authors":"Gaoang Liu, Xiuying Liu","doi":"10.1007/978-3-319-78455-7_17","DOIUrl":"https://doi.org/10.1007/978-3-319-78455-7_17","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"255 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131916703","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}
引用次数: 3
Exact Algorithms for the Max-Min Dispersion Problem 最大-最小色散问题的精确算法
Frontiers in Algorithmics Pub Date : 2018-05-08 DOI: 10.1007/978-3-319-78455-7_20
T. Akagi, Tetsu Araki, T. Horiyama, Shin-Ichi Nakano, Y. Okamoto, Y. Otachi, Toshiki Saitoh, Ryuhei Uehara, T. Uno, Kunihiro Wasa
{"title":"Exact Algorithms for the Max-Min Dispersion Problem","authors":"T. Akagi, Tetsu Araki, T. Horiyama, Shin-Ichi Nakano, Y. Okamoto, Y. Otachi, Toshiki Saitoh, Ryuhei Uehara, T. Uno, Kunihiro Wasa","doi":"10.1007/978-3-319-78455-7_20","DOIUrl":"https://doi.org/10.1007/978-3-319-78455-7_20","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128911012","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}
引用次数: 13
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信