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

Inf. Process. Lett.最新文献

筛选
英文 中文
Minimal 2-connected graphs satisfying the even cut condition 满足偶切条件的最小二连通图
Inf. Process. Lett. Pub Date : 2021-04-01 DOI: 10.1016/j.ipl.2020.106080
A. Jobson, André E. Kézdy, J. Lehel
{"title":"Minimal 2-connected graphs satisfying the even cut condition","authors":"A. Jobson, André E. Kézdy, J. Lehel","doi":"10.1016/j.ipl.2020.106080","DOIUrl":"https://doi.org/10.1016/j.ipl.2020.106080","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"13 1","pages":"106080"},"PeriodicalIF":0.0,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89527656","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
Results and conjectures on the role of the uniform distribution in the coupon collector's problem with group drawings 均匀分布在团购图问题中的作用的结果和猜想
Inf. Process. Lett. Pub Date : 2021-03-04 DOI: 10.1016/J.IPL.2021.106112
Judith Schilling
{"title":"Results and conjectures on the role of the uniform distribution in the coupon collector's problem with group drawings","authors":"Judith Schilling","doi":"10.1016/J.IPL.2021.106112","DOIUrl":"https://doi.org/10.1016/J.IPL.2021.106112","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"1 1","pages":"106112"},"PeriodicalIF":0.0,"publicationDate":"2021-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89663339","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
Differentiators and detectors 微分器和检测器
Inf. Process. Lett. Pub Date : 2021-03-01 DOI: 10.1016/J.IPL.2021.106111
A. Mili
{"title":"Differentiators and detectors","authors":"A. Mili","doi":"10.1016/J.IPL.2021.106111","DOIUrl":"https://doi.org/10.1016/J.IPL.2021.106111","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"32 1","pages":"106111"},"PeriodicalIF":0.0,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80171052","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
Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs Kruskal用嵌入式c -半环来解决部分有序成本的MST问题
Inf. Process. Lett. Pub Date : 2021-02-19 DOI: 10.1016/J.IPL.2021.106107
Stefano Bistarelli, Fabio Rossi, Francesco Santini
{"title":"Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs","authors":"Stefano Bistarelli, Fabio Rossi, Francesco Santini","doi":"10.1016/J.IPL.2021.106107","DOIUrl":"https://doi.org/10.1016/J.IPL.2021.106107","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"42 1","pages":"106107"},"PeriodicalIF":0.0,"publicationDate":"2021-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86005489","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 polynomial time algorithm for the 2-Poset Cover Problem 2-偏序集覆盖问题的多项式时间算法
Inf. Process. Lett. Pub Date : 2021-02-05 DOI: 10.1016/j.ipl.2021.106106
I. Ordanel, P. Fernandez, H. Adorna
{"title":"A polynomial time algorithm for the 2-Poset Cover Problem","authors":"I. Ordanel, P. Fernandez, H. Adorna","doi":"10.1016/j.ipl.2021.106106","DOIUrl":"https://doi.org/10.1016/j.ipl.2021.106106","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"19 1","pages":"106106"},"PeriodicalIF":0.0,"publicationDate":"2021-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81334506","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
Hardness and tractability of the γ-Complete Subgraph problem γ-完全子图问题的硬度和可追溯性
Inf. Process. Lett. Pub Date : 2021-02-04 DOI: 10.1016/j.ipl.2021.106105
Ambroise Baril, R. Dondi, M. Hosseinzadeh
{"title":"Hardness and tractability of the γ-Complete Subgraph problem","authors":"Ambroise Baril, R. Dondi, M. Hosseinzadeh","doi":"10.1016/j.ipl.2021.106105","DOIUrl":"https://doi.org/10.1016/j.ipl.2021.106105","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"3 1","pages":"106105"},"PeriodicalIF":0.0,"publicationDate":"2021-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79045508","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
A note on the strong matching preclusion problem for data center networks 数据中心网络的强匹配排除问题
Inf. Process. Lett. Pub Date : 2020-12-01 DOI: 10.1016/j.ipl.2020.106007
Tianlong Ma, Y. Mao, E. Cheng, Ping Han
{"title":"A note on the strong matching preclusion problem for data center networks","authors":"Tianlong Ma, Y. Mao, E. Cheng, Ping Han","doi":"10.1016/j.ipl.2020.106007","DOIUrl":"https://doi.org/10.1016/j.ipl.2020.106007","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"15 1","pages":"106007"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88478784","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
An Optimal Rounding for Half-Integral Weighted Minimum Strongly Connected Spanning Subgraph 半积分加权最小强连通生成子图的最优舍入
Inf. Process. Lett. Pub Date : 2020-11-11 DOI: 10.1016/j.ipl.2020.106067
D. E. Hershkowitz, Gregory Kehne, R. Ravi
{"title":"An Optimal Rounding for Half-Integral Weighted Minimum Strongly Connected Spanning Subgraph","authors":"D. E. Hershkowitz, Gregory Kehne, R. Ravi","doi":"10.1016/j.ipl.2020.106067","DOIUrl":"https://doi.org/10.1016/j.ipl.2020.106067","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"12 1","pages":"106067"},"PeriodicalIF":0.0,"publicationDate":"2020-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81739498","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
Linear Time Distributed Swap Edge Algorithms 线性时间分布式交换边算法
Inf. Process. Lett. Pub Date : 2020-09-01 DOI: 10.1007/978-3-642-38233-8_11
A. Datta, L. Larmore, L. Pagli, G. Prencipe
{"title":"Linear Time Distributed Swap Edge Algorithms","authors":"A. Datta, L. Larmore, L. Pagli, G. Prencipe","doi":"10.1007/978-3-642-38233-8_11","DOIUrl":"https://doi.org/10.1007/978-3-642-38233-8_11","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"115 1","pages":"105979"},"PeriodicalIF":0.0,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74869843","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
Computability by Monadic Second-Order Logic 一元二阶逻辑的可计算性
Inf. Process. Lett. Pub Date : 2020-08-27 DOI: 10.1016/j.ipl.2020.106074
J. Engelfriet
{"title":"Computability by Monadic Second-Order Logic","authors":"J. Engelfriet","doi":"10.1016/j.ipl.2020.106074","DOIUrl":"https://doi.org/10.1016/j.ipl.2020.106074","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"259 1","pages":"106074"},"PeriodicalIF":0.0,"publicationDate":"2020-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72804773","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学术官方微信