Combinatorial Algorithms最新文献

筛选
英文 中文
Fair Packing of Independent Sets 独立集的公平包装
Combinatorial Algorithms Pub Date : 2020-03-25 DOI: 10.1007/978-3-030-48966-3_12
Nina Chiarelli, Matjaž Krnc, Martin Milanič, U. Pferschy, Nevena Pivac, Joachim Schauer
{"title":"Fair Packing of Independent Sets","authors":"Nina Chiarelli, Matjaž Krnc, Martin Milanič, U. Pferschy, Nevena Pivac, Joachim Schauer","doi":"10.1007/978-3-030-48966-3_12","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_12","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132221857","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
Equitable d-degenerate Choosability of Graphs 图的公平d-退化可选性
Combinatorial Algorithms Pub Date : 2020-03-21 DOI: 10.1007/978-3-030-48966-3_19
Ewa Drgas-Burchardt, Hanna Furmanczyk, E. Sidorowicz
{"title":"Equitable d-degenerate Choosability of Graphs","authors":"Ewa Drgas-Burchardt, Hanna Furmanczyk, E. Sidorowicz","doi":"10.1007/978-3-030-48966-3_19","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_19","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123981047","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
Edge-Disjoint Branchings in Temporal Graphs 时间图中的边不相交分支
Combinatorial Algorithms Pub Date : 2020-02-28 DOI: 10.1007/978-3-030-48966-3_9
Victor A. Campos, Raul Lopes, Andrea Marino, Ana Silva
{"title":"Edge-Disjoint Branchings in Temporal Graphs","authors":"Victor A. Campos, Raul Lopes, Andrea Marino, Ana Silva","doi":"10.1007/978-3-030-48966-3_9","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_9","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123825196","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
Polynomial Time Algorithms for Tracking Path Problems 跟踪路径问题的多项式时间算法
Combinatorial Algorithms Pub Date : 2020-02-18 DOI: 10.1007/978-3-030-48966-3_13
Pratibha Choudhary
{"title":"Polynomial Time Algorithms for Tracking Path Problems","authors":"Pratibha Choudhary","doi":"10.1007/978-3-030-48966-3_13","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_13","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130981152","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
Nonexistence Certificates for Ovals in a Projective Plane of Order Ten 十阶投影平面上椭圆的不存在证明
Combinatorial Algorithms Pub Date : 2020-01-31 DOI: 10.1007/978-3-030-48966-3_8
Curtis Bright, Kevin K. H. Cheung, B. Stevens, I. Kotsireas, Vijay Ganesh
{"title":"Nonexistence Certificates for Ovals in a Projective Plane of Order Ten","authors":"Curtis Bright, Kevin K. H. Cheung, B. Stevens, I. Kotsireas, Vijay Ganesh","doi":"10.1007/978-3-030-48966-3_8","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_8","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115586565","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
Iterated Type Partitions 迭代类型分区
Combinatorial Algorithms Pub Date : 2020-01-22 DOI: 10.1007/978-3-030-48966-3_15
G. Cordasco, L. Gargano, A. A. Rescigno
{"title":"Iterated Type Partitions","authors":"G. Cordasco, L. Gargano, A. A. Rescigno","doi":"10.1007/978-3-030-48966-3_15","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_15","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125194675","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
Bounded Degree Group Steiner Tree Problems 有界度群Steiner树问题
Combinatorial Algorithms Pub Date : 2019-10-28 DOI: 10.1007/978-3-030-48966-3_26
G. Kortsarz, Zeev Nutov
{"title":"Bounded Degree Group Steiner Tree Problems","authors":"G. Kortsarz, Zeev Nutov","doi":"10.1007/978-3-030-48966-3_26","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_26","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"92 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131263517","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
Optimal In-place Algorithms for Basic Graph Problems 基本图问题的最优就地算法
Combinatorial Algorithms Pub Date : 2019-07-22 DOI: 10.1007/978-3-030-48966-3_10
Sankardeep Chakraborty, K. Sadakane, Srinivasa Rao Satti
{"title":"Optimal In-place Algorithms for Basic Graph Problems","authors":"Sankardeep Chakraborty, K. Sadakane, Srinivasa Rao Satti","doi":"10.1007/978-3-030-48966-3_10","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_10","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115426229","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}
引用次数: 5
Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination 改进预算连接控制和预算边顶点控制
Combinatorial Algorithms Pub Date : 2019-07-15 DOI: 10.1007/978-3-030-48966-3_28
I. Lamprou, Ioannis Sigalas, V. Zissimopoulos
{"title":"Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination","authors":"I. Lamprou, Ioannis Sigalas, V. Zissimopoulos","doi":"10.1007/978-3-030-48966-3_28","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_28","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"12126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130934228","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
Decremental Optimization of Dominating Sets Under the Reconfiguration Framework 重构框架下支配集的递减优化
Combinatorial Algorithms Pub Date : 2019-06-12 DOI: 10.1007/978-3-030-48966-3_6
Alexandre Blanché, Haruka Mizuta, P. Ouvrard, Akira Suzuki
{"title":"Decremental Optimization of Dominating Sets Under the Reconfiguration Framework","authors":"Alexandre Blanché, Haruka Mizuta, P. Ouvrard, Akira Suzuki","doi":"10.1007/978-3-030-48966-3_6","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_6","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114783653","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
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学术官方微信