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

International Workshop on Combinatorial Algorithms最新文献

筛选
英文 中文
Combinatorial Questions: How Can Graph Labelling Help? 组合问题:图形标签如何提供帮助?
International Workshop on Combinatorial Algorithms Pub Date : 2017-07-17 DOI: 10.1007/978-3-319-78825-8_2
D. Donovan, T. McCourt
{"title":"Combinatorial Questions: How Can Graph Labelling Help?","authors":"D. Donovan, T. McCourt","doi":"10.1007/978-3-319-78825-8_2","DOIUrl":"https://doi.org/10.1007/978-3-319-78825-8_2","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116052504","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
Extremal Kernelization: A Commemorative Paper 极值核化:一篇纪念论文
International Workshop on Combinatorial Algorithms Pub Date : 2017-07-17 DOI: 10.1007/978-3-319-78825-8_3
H. Fernau
{"title":"Extremal Kernelization: A Commemorative Paper","authors":"H. Fernau","doi":"10.1007/978-3-319-78825-8_3","DOIUrl":"https://doi.org/10.1007/978-3-319-78825-8_3","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117284349","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
Improved Lower Bound on Broadcast Function Based on Graph Partition 基于图划分的广播函数改进下界
International Workshop on Combinatorial Algorithms Pub Date : 2017-07-17 DOI: 10.1007/978-3-319-78825-8_18
Hovhannes A. Harutyunyan, Zhiyuan Li
{"title":"Improved Lower Bound on Broadcast Function Based on Graph Partition","authors":"Hovhannes A. Harutyunyan, Zhiyuan Li","doi":"10.1007/978-3-319-78825-8_18","DOIUrl":"https://doi.org/10.1007/978-3-319-78825-8_18","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124543927","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
Approximation Results for the Incremental Knapsack Problem 增量背包问题的逼近结果
International Workshop on Combinatorial Algorithms Pub Date : 2017-07-17 DOI: 10.1007/978-3-319-78825-8_7
F. D. Croce, U. Pferschy, Rosario Scatamacchia
{"title":"Approximation Results for the Incremental Knapsack Problem","authors":"F. D. Croce, U. Pferschy, Rosario Scatamacchia","doi":"10.1007/978-3-319-78825-8_7","DOIUrl":"https://doi.org/10.1007/978-3-319-78825-8_7","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125192776","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
On Solving the Queen Graph Coloring Problem 关于皇后图着色问题的求解
International Workshop on Combinatorial Algorithms Pub Date : 2017-07-17 DOI: 10.1007/978-3-319-78825-8_20
Michel Vasquez, Yannick Vimont
{"title":"On Solving the Queen Graph Coloring Problem","authors":"Michel Vasquez, Yannick Vimont","doi":"10.1007/978-3-319-78825-8_20","DOIUrl":"https://doi.org/10.1007/978-3-319-78825-8_20","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127532945","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
Entire H-irregularity Strength of Plane Graphs 平面图的全h不规则性强度
International Workshop on Combinatorial Algorithms Pub Date : 2017-07-17 DOI: 10.1007/978-3-319-78825-8_1
M. Bača, N. Hinding, Aisha Javed, A. Semaničová-Feňovčíková
{"title":"Entire H-irregularity Strength of Plane Graphs","authors":"M. Bača, N. Hinding, Aisha Javed, A. Semaničová-Feňovčíková","doi":"10.1007/978-3-319-78825-8_1","DOIUrl":"https://doi.org/10.1007/978-3-319-78825-8_1","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"295 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128585140","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
Improved Complexity for Power Edge Set Problem 改进的幂边集问题的复杂度
International Workshop on Combinatorial Algorithms Pub Date : 2017-07-17 DOI: 10.1007/978-3-319-78825-8_11
Benoît Darties, A. Chateau, R. Giroudeau, Mathias Weller
{"title":"Improved Complexity for Power Edge Set Problem","authors":"Benoît Darties, A. Chateau, R. Giroudeau, Mathias Weller","doi":"10.1007/978-3-319-78825-8_11","DOIUrl":"https://doi.org/10.1007/978-3-319-78825-8_11","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133988414","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
Computational Complexity Relationship between Compaction, Vertex-Compaction, and Retraction 压缩、顶点压缩和收缩之间的计算复杂度关系
International Workshop on Combinatorial Algorithms Pub Date : 2017-07-17 DOI: 10.1007/978-3-319-78825-8_13
N. Vikas
{"title":"Computational Complexity Relationship between Compaction, Vertex-Compaction, and Retraction","authors":"N. Vikas","doi":"10.1007/978-3-319-78825-8_13","DOIUrl":"https://doi.org/10.1007/978-3-319-78825-8_13","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125129808","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
Linear Ordering Based MIP Formulations for the Vertex Separation or Pathwidth Problem 基于线性排序的顶点分离或路径宽度问题的MIP公式
International Workshop on Combinatorial Algorithms Pub Date : 2017-07-17 DOI: 10.1007/978-3-319-78825-8_27
Sven Mallach
{"title":"Linear Ordering Based MIP Formulations for the Vertex Separation or Pathwidth Problem","authors":"Sven Mallach","doi":"10.1007/978-3-319-78825-8_27","DOIUrl":"https://doi.org/10.1007/978-3-319-78825-8_27","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121160650","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 Asymmetric Median Tree of Two Trees via Better Bipartite Matching Algorithm 用更好的二部匹配算法计算二树的非对称中值树
International Workshop on Combinatorial Algorithms Pub Date : 2017-07-17 DOI: 10.1007/978-3-319-78825-8_29
Ramesh Rajaby, W. Sung
{"title":"Computing Asymmetric Median Tree of Two Trees via Better Bipartite Matching Algorithm","authors":"Ramesh Rajaby, W. Sung","doi":"10.1007/978-3-319-78825-8_29","DOIUrl":"https://doi.org/10.1007/978-3-319-78825-8_29","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"26 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114028363","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
首页 上一页
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学术官方微信