勘误：[math]-Neighbor Equivalence 的更多应用：循环性和连接性约束

IF 0.9 3区数学 Q2 MATHEMATICS

SIAM Journal on Discrete Mathematics Pub Date : 2024-03-25 DOI:10.1137/23m157644x

Benjamin Bergougnoux, Mamadou M. Kanté

{"title":"勘误：[math]-Neighbor Equivalence 的更多应用：循环性和连接性约束","authors":"Benjamin Bergougnoux, Mamadou M. Kanté","doi":"10.1137/23m157644x","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Discrete Mathematics, Volume 38, Issue 1, Page 1191-1192, March 2024. <br/> Abstract. We spotted an error in our publication More applications of the d-neighbor equivalence: Acyclicity and Connetivity constraints [SIAM J. Discrete Math., 35 (2021), pp. 1881–1926]. We explain the problem and suggest a simple correction.","PeriodicalId":49530,"journal":{"name":"SIAM Journal on Discrete Mathematics","volume":"97 4 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2024-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Erratum: More Applications of the [math]-Neighbor Equivalence: Acyclicity and Connectivity Constraints\",\"authors\":\"Benjamin Bergougnoux, Mamadou M. Kanté\",\"doi\":\"10.1137/23m157644x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"SIAM Journal on Discrete Mathematics, Volume 38, Issue 1, Page 1191-1192, March 2024. <br/> Abstract. We spotted an error in our publication More applications of the d-neighbor equivalence: Acyclicity and Connetivity constraints [SIAM J. Discrete Math., 35 (2021), pp. 1881–1926]. We explain the problem and suggest a simple correction.\",\"PeriodicalId\":49530,\"journal\":{\"name\":\"SIAM Journal on Discrete Mathematics\",\"volume\":\"97 4 1\",\"pages\":\"\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIAM Journal on Discrete Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1137/23m157644x\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/23m157644x","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

SIAM 离散数学杂志》第 38 卷第 1 期第 1191-1192 页，2024 年 3 月。摘要。我们发现我们的出版物《d-邻等价的更多应用：Acyclicity and Connetivity constraints [SIAM J. Discrete Math., 35 (2021), pp.］我们解释了这个问题，并提出了一个简单的修正方法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Erratum: More Applications of the [math]-Neighbor Equivalence: Acyclicity and Connectivity Constraints

SIAM Journal on Discrete Mathematics, Volume 38, Issue 1, Page 1191-1192, March 2024.
Abstract. We spotted an error in our publication More applications of the d-neighbor equivalence: Acyclicity and Connetivity constraints [SIAM J. Discrete Math., 35 (2021), pp. 1881–1926]. We explain the problem and suggest a simple correction.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

SIAM Journal on Discrete Mathematics 数学-应用数学

CiteScore

1.90

自引率

0.00%

发文量

124

审稿时长

4-8 weeks

期刊介绍： SIAM Journal on Discrete Mathematics (SIDMA) publishes research papers of exceptional quality in pure and applied discrete mathematics, broadly interpreted. The journal''s focus is primarily theoretical rather than empirical, but the editors welcome papers that evolve from or have potential application to real-world problems. Submissions must be clearly written and make a significant contribution. Topics include but are not limited to: properties of and extremal problems for discrete structures combinatorial optimization, including approximation algorithms algebraic and enumerative combinatorics coding and information theory additive, analytic combinatorics and number theory combinatorial matrix theory and spectral graph theory design and analysis of algorithms for discrete structures discrete problems in computational complexity discrete and computational geometry discrete methods in computational biology, and bioinformatics probabilistic methods and randomized algorithms.