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

International Workshop on Combinatorial Algorithms最新文献

筛选
英文 中文
Algorithm and Hardness Results on Liar's Dominating Set and varveck -tuple Dominating Set 说谎者支配集和varveck元组支配集的算法和硬度结果
International Workshop on Combinatorial Algorithms Pub Date : 2019-07-23 DOI: 10.1007/978-3-030-25005-8_5
Sandip Banerjee, S. Bhore
{"title":"Algorithm and Hardness Results on Liar's Dominating Set and varveck -tuple Dominating Set","authors":"Sandip Banerjee, S. Bhore","doi":"10.1007/978-3-030-25005-8_5","DOIUrl":"https://doi.org/10.1007/978-3-030-25005-8_5","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"36 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":"117325944","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
Reaching 3-Connectivity via Edge-Edge Additions 通过Edge-Edge附加功能实现3-Connectivity
International Workshop on Combinatorial Algorithms Pub Date : 2019-07-23 DOI: 10.1007/978-3-030-25005-8_15
G. D. Lozzo, Ignaz Rutter
{"title":"Reaching 3-Connectivity via Edge-Edge Additions","authors":"G. D. Lozzo, Ignaz Rutter","doi":"10.1007/978-3-030-25005-8_15","DOIUrl":"https://doi.org/10.1007/978-3-030-25005-8_15","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"75 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":"114296470","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
Burrows-Wheeler Transform of Words Defined by Morphisms 由语素定义的词的Burrows-Wheeler变换
International Workshop on Combinatorial Algorithms Pub Date : 2019-07-23 DOI: 10.1007/978-3-030-25005-8_32
S. Brlek, A. Frosini, Ilaria Mancini, E. Pergola, S. Rinaldi
{"title":"Burrows-Wheeler Transform of Words Defined by Morphisms","authors":"S. Brlek, A. Frosini, Ilaria Mancini, E. Pergola, S. Rinaldi","doi":"10.1007/978-3-030-25005-8_32","DOIUrl":"https://doi.org/10.1007/978-3-030-25005-8_32","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"47 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":"124021932","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 General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications 超图模块分解的一种通用算法方案及其应用
International Workshop on Combinatorial Algorithms Pub Date : 2019-07-23 DOI: 10.1007/978-3-030-25005-8_21
M. Habib, F. D. Montgolfier, Lalla Mouatadid, Mengchuan Zou
{"title":"A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications","authors":"M. Habib, F. D. Montgolfier, Lalla Mouatadid, Mengchuan Zou","doi":"10.1007/978-3-030-25005-8_21","DOIUrl":"https://doi.org/10.1007/978-3-030-25005-8_21","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"8 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":"128868061","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
Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs 有界退化和有界度超图中的最大无冗余集枚举
International Workshop on Combinatorial Algorithms Pub Date : 2019-07-23 DOI: 10.1007/978-3-030-25005-8_13
A. Conte, M. Kanté, Andrea Marino, T. Uno
{"title":"Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs","authors":"A. Conte, M. Kanté, Andrea Marino, T. Uno","doi":"10.1007/978-3-030-25005-8_13","DOIUrl":"https://doi.org/10.1007/978-3-030-25005-8_13","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"3 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":"131813750","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
Supermagic Graphs with Many Odd Degrees 具有多奇次的超幻图
International Workshop on Combinatorial Algorithms Pub Date : 2019-07-23 DOI: 10.1007/978-3-030-25005-8_19
D. Froncek, J. Qiu
{"title":"Supermagic Graphs with Many Odd Degrees","authors":"D. Froncek, J. Qiu","doi":"10.1007/978-3-030-25005-8_19","DOIUrl":"https://doi.org/10.1007/978-3-030-25005-8_19","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":"128209692","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 Note on Handicap Incomplete Tournaments 关于残障不完全比赛的说明
International Workshop on Combinatorial Algorithms Pub Date : 2019-07-23 DOI: 10.1007/978-3-030-25005-8_1
A. V. Prajeesh, Krishnan Paramasivam, N. Kamatchi
{"title":"A Note on Handicap Incomplete Tournaments","authors":"A. V. Prajeesh, Krishnan Paramasivam, N. Kamatchi","doi":"10.1007/978-3-030-25005-8_1","DOIUrl":"https://doi.org/10.1007/978-3-030-25005-8_1","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"32 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":"128328772","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
Maximum Clique Exhaustive Search in Circulant k-Hypergraphs 循环k-超图中的最大团穷举搜索
International Workshop on Combinatorial Algorithms Pub Date : 2019-07-23 DOI: 10.1007/978-3-030-25005-8_31
Lachlan Plant, Lucia Moura
{"title":"Maximum Clique Exhaustive Search in Circulant k-Hypergraphs","authors":"Lachlan Plant, Lucia Moura","doi":"10.1007/978-3-030-25005-8_31","DOIUrl":"https://doi.org/10.1007/978-3-030-25005-8_31","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"4 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":"130042184","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
Disjoint Clustering in Combinatorial Circuits 组合电路中的不相交聚类
International Workshop on Combinatorial Algorithms Pub Date : 2019-07-23 DOI: 10.1007/978-3-030-25005-8_17
Zola Donovan, K. Subramani, V. Mkrtchyan
{"title":"Disjoint Clustering in Combinatorial Circuits","authors":"Zola Donovan, K. Subramani, V. Mkrtchyan","doi":"10.1007/978-3-030-25005-8_17","DOIUrl":"https://doi.org/10.1007/978-3-030-25005-8_17","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"23 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":"131788470","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
Finding Periods in Cartesian Tree Matching 在笛卡儿树匹配中寻找周期
International Workshop on Combinatorial Algorithms Pub Date : 2019-07-23 DOI: 10.1007/978-3-030-25005-8_7
Magsarjav Bataa, Sung Gwan Park, A. Amir, G. M. Landau, Kunsoo Park
{"title":"Finding Periods in Cartesian Tree Matching","authors":"Magsarjav Bataa, Sung Gwan Park, A. Amir, G. M. Landau, Kunsoo Park","doi":"10.1007/978-3-030-25005-8_7","DOIUrl":"https://doi.org/10.1007/978-3-030-25005-8_7","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"27 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":"128090899","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学术官方微信