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

Treewidth, Kernels, and Algorithms最新文献

筛选
英文 中文
Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (平面)不相交路径的有效图子理论与参数化算法
Treewidth, Kernels, and Algorithms Pub Date : 2020-08-19 DOI: 10.1007/978-3-030-42071-0_9
D. Lokshtanov, Saket Saurabh, M. Zehavi
{"title":"Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths","authors":"D. Lokshtanov, Saket Saurabh, M. Zehavi","doi":"10.1007/978-3-030-42071-0_9","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_9","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132811664","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
Four Shorts Stories on Surprising Algorithmic Uses of Treewidth 关于Treewidth令人惊讶的算法使用的四个小故事
Treewidth, Kernels, and Algorithms Pub Date : 2020-08-18 DOI: 10.1007/978-3-030-42071-0_10
D. Marx
{"title":"Four Shorts Stories on Surprising Algorithmic Uses of Treewidth","authors":"D. Marx","doi":"10.1007/978-3-030-42071-0_10","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_10","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131695399","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
Fast Algorithms for Join Operations on Tree Decompositions 树分解中联接操作的快速算法
Treewidth, Kernels, and Algorithms Pub Date : 2020-06-01 DOI: 10.1007/978-3-030-42071-0_18
Johan M. M. van Rooij
{"title":"Fast Algorithms for Join Operations on Tree Decompositions","authors":"Johan M. M. van Rooij","doi":"10.1007/978-3-030-42071-0_18","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_18","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"26 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126057368","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
Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs 球图中支配集和单位球图中加权支配集的下界
Treewidth, Kernels, and Algorithms Pub Date : 2020-05-10 DOI: 10.1007/978-3-030-42071-0_5
M. D. Berg, Sándor Kisfaludi-Bak
{"title":"Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs","authors":"M. D. Berg, Sándor Kisfaludi-Bak","doi":"10.1007/978-3-030-42071-0_5","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_5","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115833169","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
Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds 与Hans Bodlaender的交叉路径:对稀疏化下界交叉组合的个人看法
Treewidth, Kernels, and Algorithms Pub Date : 2020-04-21 DOI: 10.1007/978-3-030-42071-0_8
B. Jansen
{"title":"Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds","authors":"B. Jansen","doi":"10.1007/978-3-030-42071-0_8","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_8","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128062688","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 Retrospective on (Meta) Kernelization 回顾(元)核化
Treewidth, Kernels, and Algorithms Pub Date : 2020-04-20 DOI: 10.1007/978-3-030-42071-0_16
D. Thilikos
{"title":"A Retrospective on (Meta) Kernelization","authors":"D. Thilikos","doi":"10.1007/978-3-030-42071-0_16","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_16","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121169695","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
Seeing Arboretum for the (partial k-) Trees 参见Arboretum的(部分k-)树
Treewidth, Kernels, and Algorithms Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-42071-0_1
S. Arnborg, A. Proskurowski
{"title":"Seeing Arboretum for the (partial k-) Trees","authors":"S. Arnborg, A. Proskurowski","doi":"10.1007/978-3-030-42071-0_1","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_1","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"45 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":"123989215","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
Collaborating with Hans: Some Remaining Wonderments 与汉斯合作:一些剩余的奇迹
Treewidth, Kernels, and Algorithms Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-42071-0_2
M. Fellows, Frances A. Rosamond
{"title":"Collaborating with Hans: Some Remaining Wonderments","authors":"M. Fellows, Frances A. Rosamond","doi":"10.1007/978-3-030-42071-0_2","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_2","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"31 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":"114802336","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
Algorithms, Complexity, and Hans 算法、复杂性和汉斯
Treewidth, Kernels, and Algorithms Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-42071-0_4
J. Leeuwen
{"title":"Algorithms, Complexity, and Hans","authors":"J. Leeuwen","doi":"10.1007/978-3-030-42071-0_4","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_4","url":null,"abstract":"","PeriodicalId":426734,"journal":{"name":"Treewidth, Kernels, and Algorithms","volume":"114 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":"116495365","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 Tree Decompositions 计算树分解
Treewidth, Kernels, and Algorithms Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-42071-0_14
Michal Pilipczuk
{"title":"Computing Tree Decompositions","authors":"Michal Pilipczuk","doi":"10.1007/978-3-030-42071-0_14","DOIUrl":"https://doi.org/10.1007/978-3-030-42071-0_14","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":"131794847","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
下一页 尾页
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学术官方微信