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

Fun with Algorithms最新文献

筛选
英文 中文
Hitori Number
Fun with Algorithms Pub Date : 2012-06-04 DOI: 10.1007/978-3-642-30347-0_33
Akira Suzuki, Kei Uchizawa, T. Uno
{"title":"Hitori Number","authors":"Akira Suzuki, Kei Uchizawa, T. Uno","doi":"10.1007/978-3-642-30347-0_33","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_33","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114326629","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
Computing Maximum Hamiltonian Paths in Complete Graphs with Tree Metric 树度量完全图中最大哈密顿路径的计算
Fun with Algorithms Pub Date : 2012-06-04 DOI: 10.1007/978-3-642-30347-0_34
W. Rytter, Bartosz Szreder
{"title":"Computing Maximum Hamiltonian Paths in Complete Graphs with Tree Metric","authors":"W. Rytter, Bartosz Szreder","doi":"10.1007/978-3-642-30347-0_34","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_34","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"258 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124220650","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
Divorcing Made Easy 离婚变得容易了
Fun with Algorithms Pub Date : 2012-06-04 DOI: 10.1007/978-3-642-30347-0_30
K. Pruhs, G. Woeginger
{"title":"Divorcing Made Easy","authors":"K. Pruhs, G. Woeginger","doi":"10.1007/978-3-642-30347-0_30","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_30","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128734056","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}
引用次数: 15
Counting Perfect Matchings in Graphs of Degree 3 3次图的完美匹配计数
Fun with Algorithms Pub Date : 2012-06-04 DOI: 10.1007/978-3-642-30347-0_20
Martin Fürer
{"title":"Counting Perfect Matchings in Graphs of Degree 3","authors":"Martin Fürer","doi":"10.1007/978-3-642-30347-0_20","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_20","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116931183","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
Making Life Easier for Firefighters 让消防员的生活更轻松
Fun with Algorithms Pub Date : 2012-06-04 DOI: 10.1007/978-3-642-30347-0_19
F. Fomin, P. Heggernes, E. J. V. Leeuwen
{"title":"Making Life Easier for Firefighters","authors":"F. Fomin, P. Heggernes, E. J. V. Leeuwen","doi":"10.1007/978-3-642-30347-0_19","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_19","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126736589","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}
引用次数: 15
On the Complexity of Rolling Block and Alice Mazes 论滚动积木和爱丽丝迷宫的复杂性
Fun with Algorithms Pub Date : 2012-06-04 DOI: 10.1007/978-3-642-30347-0_22
M. Holzer, Sebastian Jakobi
{"title":"On the Complexity of Rolling Block and Alice Mazes","authors":"M. Holzer, Sebastian Jakobi","doi":"10.1007/978-3-642-30347-0_22","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_22","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117205663","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}
引用次数: 15
A New Analysis of Best Fit Bin Packing 最佳装箱方式的新分析
Fun with Algorithms Pub Date : 2012-06-04 DOI: 10.1007/978-3-642-30347-0_31
J. Sgall
{"title":"A New Analysis of Best Fit Bin Packing","authors":"J. Sgall","doi":"10.1007/978-3-642-30347-0_31","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_31","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128951006","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}
引用次数: 9
Mad at Edge Crossings? Break the Edges! 在边境路口生气?打破边缘!
Fun with Algorithms Pub Date : 2012-06-04 DOI: 10.1007/978-3-642-30347-0_7
Till Bruckdorfer, M. Kaufmann
{"title":"Mad at Edge Crossings? Break the Edges!","authors":"Till Bruckdorfer, M. Kaufmann","doi":"10.1007/978-3-642-30347-0_7","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_7","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127387661","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}
引用次数: 23
The Multi-interval Ulam-Rényi Game 多间隔ulam - rassanyi游戏
Fun with Algorithms Pub Date : 2012-06-04 DOI: 10.1007/978-3-642-30347-0_10
F. Cicalese
{"title":"The Multi-interval Ulam-Rényi Game","authors":"F. Cicalese","doi":"10.1007/978-3-642-30347-0_10","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_10","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125754220","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}
引用次数: 9
Grid Graphs with Diagonal Edges and the Complexity of Xmas Mazes 具有对角边的网格图与圣诞迷宫的复杂性
Fun with Algorithms Pub Date : 2012-06-04 DOI: 10.1007/978-3-642-30347-0_23
M. Holzer, Sebastian Jakobi
{"title":"Grid Graphs with Diagonal Edges and the Complexity of Xmas Mazes","authors":"M. Holzer, Sebastian Jakobi","doi":"10.1007/978-3-642-30347-0_23","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_23","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"741 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122957161","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
首页 上一页 下一页 尾页
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学术官方微信