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

Treewidth, Kernels, and Algorithms最新文献

筛选
英文 中文
Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices 基于矩阵秩相关参数的np困难问题的算法
Treewidth, Kernels, and Algorithms Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-42071-0_11
Jesper Nederlof
{"title":"Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices","authors":"Jesper Nederlof","doi":"10.1007/978-3-030-42071-0_11","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_11","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115228544","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
Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs 通过ilp解决树宽问题的可能和不可能的尝试
Treewidth, Kernels, and Algorithms Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-42071-0_7
A. Grigoriev
{"title":"Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs","authors":"A. Grigoriev","doi":"10.1007/978-3-030-42071-0_7","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_7","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"53 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121017317","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
Games, Puzzles and Treewidth 游戏，谜题和树宽度
Treewidth, Kernels, and Algorithms Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-42071-0_17
Tom C. van der Zanden
{"title":"Games, Puzzles and Treewidth","authors":"Tom C. van der Zanden","doi":"10.1007/978-3-030-42071-0_17","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_17","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128800216","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
Hans Bodlaender and the Theory of Kernelization Lower Bounds Hans Bodlaender与核化下界理论
Treewidth, Kernels, and Algorithms Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-42071-0_3
D. Hermelin
{"title":"Hans Bodlaender and the Theory of Kernelization Lower Bounds","authors":"D. Hermelin","doi":"10.1007/978-3-030-42071-0_3","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_3","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123873700","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
A Survey on Spanning Tree Congestion 生成树拥塞研究综述
Treewidth, Kernels, and Algorithms Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-42071-0_12
Y. Otachi
{"title":"A Survey on Spanning Tree Congestion","authors":"Y. Otachi","doi":"10.1007/978-3-030-42071-0_12","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_12","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121336647","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
Surprising Applications of Treewidth Bounds for Planar Graphs 平面图树宽边界的惊人应用
Treewidth, Kernels, and Algorithms Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-42071-0_13
Marcin Pilipczuk
{"title":"Surprising Applications of Treewidth Bounds for Planar Graphs","authors":"Marcin Pilipczuk","doi":"10.1007/978-3-030-42071-0_13","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_13","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131753448","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
Experimental Analysis of Treewidth 树宽的实验分析
Treewidth, Kernels, and Algorithms Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-42071-0_15
H. Tamaki
{"title":"Experimental Analysis of Treewidth","authors":"H. Tamaki","doi":"10.1007/978-3-030-42071-0_15","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_15","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114685132","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
Treewidth, Kernels, and Algorithms: Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday 树宽、核和算法:献给汉斯·l·博德兰德60岁生日的论文
Treewidth, Kernels, and Algorithms Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-42071-0
F. Fomin, Stefan Kratsch, E. J. V. Leeuwen
{"title":"Treewidth, Kernels, and Algorithms: Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday","authors":"F. Fomin, Stefan Kratsch, E. J. V. Leeuwen","doi":"10.1007/978-3-030-42071-0","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116166687","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
首页 上一页
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学术官方微信