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

International Workshop on Combinatorial Algorithms最新文献

筛选
英文 中文
Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism 自定界数的排序与排序及其在树同构中的应用
International Workshop on Combinatorial Algorithms Pub Date : 2020-02-17 DOI: 10.1007/978-3-031-34347-6_30
Frank Kammer, Andrej Sajenko
{"title":"Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism","authors":"Frank Kammer, Andrej Sajenko","doi":"10.1007/978-3-031-34347-6_30","DOIUrl":"https://doi.org/10.1007/978-3-031-34347-6_30","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"130 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124245315","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
Exact Polynomial Time Algorithm for the Response Time Analysis of Harmonic Tasks with Constrained Release Jitter 含约束释放抖动谐波任务响应时间分析的精确多项式时间算法
International Workshop on Combinatorial Algorithms Pub Date : 2019-11-30 DOI: 10.1007/978-3-031-06678-8_33
T. Nguyen, W. Grass, K. Jansen
{"title":"Exact Polynomial Time Algorithm for the Response Time Analysis of Harmonic Tasks with Constrained Release Jitter","authors":"T. Nguyen, W. Grass, K. Jansen","doi":"10.1007/978-3-031-06678-8_33","DOIUrl":"https://doi.org/10.1007/978-3-031-06678-8_33","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129442128","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
Incremental Algorithm for Minimum Cut and Edge Connectivity in Hypergraph 超图最小割边连通性的增量算法
International Workshop on Combinatorial Algorithms Pub Date : 2019-07-23 DOI: 10.1007/978-3-030-25005-8_20
Rahul Gupta, S. Karmakar
{"title":"Incremental Algorithm for Minimum Cut and Edge Connectivity in Hypergraph","authors":"Rahul Gupta, S. Karmakar","doi":"10.1007/978-3-030-25005-8_20","DOIUrl":"https://doi.org/10.1007/978-3-030-25005-8_20","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123908600","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
Parameterized Algorithms for Graph Burning Problem 图刻录问题的参数化算法
International Workshop on Combinatorial Algorithms Pub Date : 2019-07-23 DOI: 10.1007/978-3-030-25005-8_25
Anjeneya Swami Kare, I. Reddy
{"title":"Parameterized Algorithms for Graph Burning Problem","authors":"Anjeneya Swami Kare, I. Reddy","doi":"10.1007/978-3-030-25005-8_25","DOIUrl":"https://doi.org/10.1007/978-3-030-25005-8_25","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"504 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116328438","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}
引用次数: 18
The Hull Number in the Convexity of Induced Paths of Order 3 3阶诱导路径凸性中的船体数
International Workshop on Combinatorial Algorithms Pub Date : 2019-07-23 DOI: 10.1007/978-3-030-25005-8_18
M. C. Dourado, L. Penso, D. Rautenbach
{"title":"The Hull Number in the Convexity of Induced Paths of Order 3","authors":"M. C. Dourado, L. Penso, D. Rautenbach","doi":"10.1007/978-3-030-25005-8_18","DOIUrl":"https://doi.org/10.1007/978-3-030-25005-8_18","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131356488","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
A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber 零能见度警察与抢劫犯下界的一种划分方法
International Workshop on Combinatorial Algorithms Pub Date : 2019-07-23 DOI: 10.1007/978-3-030-25005-8_36
Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles
{"title":"A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber","authors":"Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles","doi":"10.1007/978-3-030-25005-8_36","DOIUrl":"https://doi.org/10.1007/978-3-030-25005-8_36","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121483461","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
Cops and Robber on Some Families of Oriented Graphs 一些有向图族上的警察和强盗
International Workshop on Combinatorial Algorithms Pub Date : 2019-07-23 DOI: 10.1007/978-3-030-25005-8_16
Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen
{"title":"Cops and Robber on Some Families of Oriented Graphs","authors":"Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen","doi":"10.1007/978-3-030-25005-8_16","DOIUrl":"https://doi.org/10.1007/978-3-030-25005-8_16","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125957629","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
Computing the k-Crossing Visibility Region of a Point in a Polygon 计算多边形中点的k交叉可见区域
International Workshop on Combinatorial Algorithms Pub Date : 2019-07-23 DOI: 10.1007/978-3-030-25005-8_2
Yeganeh Bahoo, P. Bose, Stephane Durocher, T. Shermer
{"title":"Computing the k-Crossing Visibility Region of a Point in a Polygon","authors":"Yeganeh Bahoo, P. Bose, Stephane Durocher, T. Shermer","doi":"10.1007/978-3-030-25005-8_2","DOIUrl":"https://doi.org/10.1007/978-3-030-25005-8_2","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129126441","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
Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs 幂边集和零强迫集在三次图中仍然是一个难题
International Workshop on Combinatorial Algorithms Pub Date : 2019-07-23 DOI: 10.1007/978-3-030-25005-8_11
Pierre Cazals, Benoît Darties, A. Chateau, R. Giroudeau, Mathias Weller
{"title":"Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs","authors":"Pierre Cazals, Benoît Darties, A. Chateau, R. Giroudeau, Mathias Weller","doi":"10.1007/978-3-030-25005-8_11","DOIUrl":"https://doi.org/10.1007/978-3-030-25005-8_11","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126828914","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
Succinct Representation of Linear Extensions via MDDs and Its Application to Scheduling Under Precedence Constraints mdd线性扩展的简洁表示及其在优先约束下调度中的应用
International Workshop on Combinatorial Algorithms Pub Date : 2019-07-23 DOI: 10.1007/978-3-030-25005-8_30
Fumito Miyake, Eiji Takimoto, Kohei Hatano
{"title":"Succinct Representation of Linear Extensions via MDDs and Its Application to Scheduling Under Precedence Constraints","authors":"Fumito Miyake, Eiji Takimoto, Kohei Hatano","doi":"10.1007/978-3-030-25005-8_30","DOIUrl":"https://doi.org/10.1007/978-3-030-25005-8_30","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"11 3-4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132063442","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
首页 上一页 下一页 尾页
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学术官方微信