Combinatorial Algorithms最新文献

筛选
英文 中文
Acyclic Matching in Some Subclasses of Graphs 图的若干子类中的无环匹配
Combinatorial Algorithms Pub Date : 2020-04-30 DOI: 10.1007/978-3-030-48966-3_31
B. S. Panda, Juhi Chaudhary
{"title":"Acyclic Matching in Some Subclasses of Graphs","authors":"B. S. Panda, Juhi Chaudhary","doi":"10.1007/978-3-030-48966-3_31","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_31","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116892810","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}
引用次数: 8
A Family of Tree-Based Generators for Bubbles in Directed Graphs 一类基于树的有向图气泡生成器
Combinatorial Algorithms Pub Date : 2020-04-30 DOI: 10.1007/978-3-030-48966-3_2
V. Acuña, Leandro Lima, G. Italiano, Luca Pepè Sciarria, M. Sagot, B. Sinaimeri
{"title":"A Family of Tree-Based Generators for Bubbles in Directed Graphs","authors":"V. Acuña, Leandro Lima, G. Italiano, Luca Pepè Sciarria, M. Sagot, B. Sinaimeri","doi":"10.1007/978-3-030-48966-3_2","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_2","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124839588","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 Micro-world of Cographs 摄影的微观世界
Combinatorial Algorithms Pub Date : 2020-04-30 DOI: 10.1007/978-3-030-48966-3_3
Bogdan Alecu, V. Lozin, D. Werra
{"title":"The Micro-world of Cographs","authors":"Bogdan Alecu, V. Lozin, D. Werra","doi":"10.1007/978-3-030-48966-3_3","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_3","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128399618","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
Further Results on Online Node- and Edge-Deletion Problems with Advice 带通知的在线节点和边删除问题的进一步结果
Combinatorial Algorithms Pub Date : 2020-04-30 DOI: 10.1007/978-3-030-48966-3_11
Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, P. Rossmanith
{"title":"Further Results on Online Node- and Edge-Deletion Problems with Advice","authors":"Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, P. Rossmanith","doi":"10.1007/978-3-030-48966-3_11","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_11","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114191101","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
Two Robots Patrolling on a Line: Integer Version and Approximability 两个机器人在一条线上巡逻:整数版本和近似性
Combinatorial Algorithms Pub Date : 2020-04-30 DOI: 10.1007/978-3-030-48966-3_16
P. Damaschke
{"title":"Two Robots Patrolling on a Line: Integer Version and Approximability","authors":"P. Damaschke","doi":"10.1007/978-3-030-48966-3_16","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_16","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134370511","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
Between Proper and Strong Edge-Colorings of Subcubic Graphs 次三次图的强边着色与真边着色之间的关系
Combinatorial Algorithms Pub Date : 2020-04-30 DOI: 10.1007/978-3-030-48966-3_27
H. Hocquard, Dimitri Lajou, Borut Lužar
{"title":"Between Proper and Strong Edge-Colorings of Subcubic Graphs","authors":"H. Hocquard, Dimitri Lajou, Borut Lužar","doi":"10.1007/978-3-030-48966-3_27","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_27","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132218861","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
On the Complexity of Singly Connected Vertex Deletion 单连通顶点删除的复杂性
Combinatorial Algorithms Pub Date : 2020-04-30 DOI: 10.1007/978-3-030-48966-3_18
Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh
{"title":"On the Complexity of Singly Connected Vertex Deletion","authors":"Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh","doi":"10.1007/978-3-030-48966-3_18","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_18","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123773413","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
New Bounds for Maximizing Revenue in Online Dial-a-Ride 在线叫车服务收益最大化的新界限
Combinatorial Algorithms Pub Date : 2020-04-30 DOI: 10.1007/978-3-030-48966-3_14
Ananya D. Christman, Christine Chung, Nicholas Jaczko, Tianzhi Li, Scott Westvold, Xinyue Xu, David S. Yuen
{"title":"New Bounds for Maximizing Revenue in Online Dial-a-Ride","authors":"Ananya D. Christman, Christine Chung, Nicholas Jaczko, Tianzhi Li, Scott Westvold, Xinyue Xu, David S. Yuen","doi":"10.1007/978-3-030-48966-3_14","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_14","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123925010","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
Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges 排序稀疏图以最小化边的右端和
Combinatorial Algorithms Pub Date : 2020-04-30 DOI: 10.1007/978-3-030-48966-3_17
P. Damaschke
{"title":"Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges","authors":"P. Damaschke","doi":"10.1007/978-3-030-48966-3_17","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_17","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"485 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123060570","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
On the Complexity of Stackelberg Matroid Pricing Problems 关于Stackelberg矩阵定价问题的复杂性
Combinatorial Algorithms Pub Date : 2020-04-30 DOI: 10.1007/978-3-030-48966-3_7
Toni Böhnlein, Oliver Schaudt
{"title":"On the Complexity of Stackelberg Matroid Pricing Problems","authors":"Toni Böhnlein, Oliver Schaudt","doi":"10.1007/978-3-030-48966-3_7","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_7","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123683907","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
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学术官方微信