Information Processing Letters最新文献

{"title":"Lower and upper bounds on graph communicabilities","authors":"Amir Hossein Ghodrati ,&nbsp;Mohammad Ali Hosseinzadeh","doi":"10.1016/j.ipl.2024.106501","DOIUrl":"https://doi.org/10.1016/j.ipl.2024.106501","url":null,"abstract":"<div><p>In this paper, some lower and upper bounds for the subgraph centrality and communicability of a graph are proved. The expected value of the normalized total communicability of a random <span><math><mi>G</mi><mo>(</mo><mi>n</mi><mo>,</mo><mi>p</mi><mo>)</mo></math></span> graph is also considered and asymptotically determined. Moreover, some computational results are presented to compare the bounds obtained in this paper with some other bounds in the literature.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"187 ","pages":"Article 106501"},"PeriodicalIF":0.5,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140905396","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Leveraging parameterized Chernoff bounds for simplified algorithm analyses","authors":"Michael Dillencourt ,&nbsp;Michael T. Goodrich ,&nbsp;Michael Mitzenmacher","doi":"10.1016/j.ipl.2024.106516","DOIUrl":"https://doi.org/10.1016/j.ipl.2024.106516","url":null,"abstract":"<div><p>In this paper, we derive parameterized Chernoff bounds and show their applications for simplifying the analysis of some well-known probabilistic algorithms and data structures. The parameterized Chernoff bounds we provide give probability bounds that are powers of two, with a clean formulation of the relation between the constant in the exponent and the relative distance from the mean. In addition, we provide new simplified analyses with these bounds for hash tables, randomized routing, and a simplified, non-recursive adaptation of the Floyd-Rivest selection algorithm.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"187 ","pages":"Article 106516"},"PeriodicalIF":0.5,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0020019024000462/pdfft?md5=67dfff867dbb54118accce695281b16f&pid=1-s2.0-S0020019024000462-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141323310","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Reduced meet over labelling-based semantics in abstract argumentation","authors":"Lixing Tan ,&nbsp;Zhaohui Zhu ,&nbsp;Jinjin Zhang","doi":"10.1016/j.ipl.2024.106514","DOIUrl":"https://doi.org/10.1016/j.ipl.2024.106514","url":null,"abstract":"<div><p>The labelling-based approach of <em>abstract argumentation frameworks</em> (AAFs) is beneficial for various applications requiring different levels of decisiveness. For labelling-based semantics, this paper provides an operator so-called reduced meet modulo an ultrafilter, which is inspired by its counterpart over extensions. All criteria involved in the definitions of fundamental labelling-based semantics in AAFs are shown to be closed under this operator. Based on this fact, this paper develops a simple and uniform way for exploring common properties of labelling-based semantics in AAFs, including the compactness of extensibility, the Dcpo and Lindenbaum properties, etc.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"187 ","pages":"Article 106514"},"PeriodicalIF":0.5,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141250242","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"On conflict-free cuts: Algorithms and complexity","authors":"Johannes Rauch ,&nbsp;Dieter Rautenbach ,&nbsp;Uéverton S. Souza","doi":"10.1016/j.ipl.2024.106503","DOIUrl":"https://doi.org/10.1016/j.ipl.2024.106503","url":null,"abstract":"<div><p>One way to define the <span>Matching Cut</span> problem is: Given a graph <em>G</em>, is there an edge-cut <em>M</em> of <em>G</em> such that <em>M</em> is an independent set in the line graph of <em>G</em>? We propose the more general <span>Conflict-Free Cut</span> problem: Together with the graph <em>G</em>, we are given a so-called conflict graph <span><math><mover><mrow><mi>G</mi></mrow><mrow><mo>ˆ</mo></mrow></mover></math></span> on the edges of <em>G</em>, and we ask for an edge-cutset <em>M</em> of <em>G</em> that is independent in <span><math><mover><mrow><mi>G</mi></mrow><mrow><mo>ˆ</mo></mrow></mover></math></span>. Since conflict-free settings are popular generalizations of classical optimization problems and <span>Conflict-Free Cut</span> was not considered in the literature so far, we start the study of the problem. We show that the problem is <span><math><mi>NP</mi></math></span>-complete even when the maximum degree of <em>G</em> is 5 and <span><math><mover><mrow><mi>G</mi></mrow><mrow><mo>ˆ</mo></mrow></mover></math></span> is 1-regular. The same reduction implies an exponential lower bound on the solvability based on the Exponential Time Hypothesis. We also give parameterized complexity results: We show that the problem is fixed-parameter tractable with the vertex cover number of <em>G</em> as a parameter, and we show <span><math><mi>W</mi><mo>[</mo><mn>1</mn><mo>]</mo></math></span>-hardness even when <em>G</em> has a feedback vertex set of size one, and the clique cover number of <span><math><mover><mrow><mi>G</mi></mrow><mrow><mo>ˆ</mo></mrow></mover></math></span> is the parameter. Since the clique cover number of <span><math><mover><mrow><mi>G</mi></mrow><mrow><mo>ˆ</mo></mrow></mover></math></span> is an upper bound on the independence number of <span><math><mover><mrow><mi>G</mi></mrow><mrow><mo>ˆ</mo></mrow></mover></math></span> and thus the solution size, this implies <span><math><mi>W</mi><mo>[</mo><mn>1</mn><mo>]</mo></math></span>-hardness when parameterized by the cut size. We list polynomial-time solvable cases and interesting open problems. At last, we draw a connection to a symmetric variant of <span>SAT</span>.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"187 ","pages":"Article 106503"},"PeriodicalIF":0.5,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0020019024000334/pdfft?md5=245b78d016a76de957fec713f0824a46&pid=1-s2.0-S0020019024000334-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140948679","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Branching bisimulation semantics for quantum processes","authors":"Hao Wu ,&nbsp;Qizhe Yang ,&nbsp;Huan Long","doi":"10.1016/j.ipl.2024.106492","DOIUrl":"https://doi.org/10.1016/j.ipl.2024.106492","url":null,"abstract":"<div><p>The qCCS model proposed by Feng et al. provides a powerful framework to describe and reason about quantum communication systems that could be entangled with the environment. However, they only studied weak bisimulation semantics. In this paper we propose a new branching bisimilarity for qCCS and show that it is a congruence. The new bisimilarity is based on the concept of <em>ϵ</em>-tree and preserves the branching structure of concurrent processes where both quantum and classical components are allowed. Furthermore, we present a polynomial time equivalence checking algorithm for the ground version of our branching bisimilarity.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"186 ","pages":"Article 106492"},"PeriodicalIF":0.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140163830","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The group factorization problem in finite groups of Lie type","authors":"Haibo Hong,&nbsp;Shi Bai,&nbsp;Fenghao Liu","doi":"10.1016/j.ipl.2024.106484","DOIUrl":"https://doi.org/10.1016/j.ipl.2024.106484","url":null,"abstract":"<div><p>With the development of Lie theory, Lie groups have profound significance in many branches of mathematics and physics. In Lie theory, matrix exponential plays a crucial role between Lie groups and Lie algebras. Meanwhile, as finite analogues of Lie groups, finite groups of Lie type also have wide application scenarios in mathematics and physics owning to their unique mathematical structures. In this context, it is meaningful to explore the potential applications of finite groups of Lie type in cryptography. In this paper, we firstly built the relationship between matrix exponential and discrete logarithmic problem (DLP) in finite groups of Lie type. Afterwards, we proved that the complexity of solving non-abelian factorization (NAF) problem is polynomial with the rank <em>n</em> of the finite group of Lie type. Furthermore, combining with the Algebraic Span, we proposed an efficient algorithm for solving group factorization problem (GFP) in finite groups of Lie type. Therefore, it's still an open problem to devise secure cryptosystems based on Lie theory.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"186 ","pages":"Article 106484"},"PeriodicalIF":0.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140014410","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Splitting NP-complete sets infinitely","authors":"Liyu Zhang,&nbsp;Mahmoud Quweider,&nbsp;Fitra Khan,&nbsp;Hansheng Lei","doi":"10.1016/j.ipl.2024.106472","DOIUrl":"10.1016/j.ipl.2024.106472","url":null,"abstract":"<div><p>Glaßer et al. (SIAMJCOMP 2009 and TCS 2009) proved that NP-complete languages are polynomial-time mitotic for the many-one reduction, meaning that each NP-complete language <em>L</em> can be split into two NP-complete languages <span><math><mi>L</mi><mo>∩</mo><mi>S</mi></math></span> and <span><math><mi>L</mi><mo>∩</mo><mover><mrow><mi>S</mi></mrow><mo>‾</mo></mover></math></span>, where <em>S</em> is a language in P. It follows that every NP-complete language can be partitioned into an arbitrary <em>finite</em> number of NP-complete languages. We strengthen and generalize this result by showing that every NP-complete language can be partitioned into <em>infinitely</em> many NP-complete languages. Furthermore those NP-complete languages resulting from such partitioning can be <em>effectively presented</em>.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"186 ","pages":"Article 106472"},"PeriodicalIF":0.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139518105","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Smaller kernels for two vertex deletion problems","authors":"Dekel Tsur","doi":"10.1016/j.ipl.2024.106493","DOIUrl":"https://doi.org/10.1016/j.ipl.2024.106493","url":null,"abstract":"<div><p>In this paper we consider two vertex deletion problems. In the <span>Block Vertex Deletion</span> problem, the input is a graph <em>G</em> and an integer <em>k</em>, and the goal is to decide whether there is a set of at most <em>k</em> vertices whose removal from <em>G</em> result in a block graph (a graph in which every biconnected component is a clique). In the <span>Pathwidth One Vertex Deletion</span> problem, the input is a graph <em>G</em> and an integer <em>k</em>, and the goal is to decide whether there is a set of at most <em>k</em> vertices whose removal from <em>G</em> result in a graph with pathwidth at most one. We give a kernel for <span>Block Vertex Deletion</span> with <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>k</mi></mrow><mrow><mn>3</mn></mrow></msup><mo>)</mo></math></span> vertices and a kernel for <span>Pathwidth One Vertex Deletion</span> with <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math></span> vertices. Our results improve the previous <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>k</mi></mrow><mrow><mn>4</mn></mrow></msup><mo>)</mo></math></span>-vertex kernel for <span>Block Vertex Deletion</span> (Agrawal et al., 2016 <span>[1]</span>) and the <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>k</mi></mrow><mrow><mn>3</mn></mrow></msup><mo>)</mo></math></span>-vertex kernel for <span>Pathwidth One Vertex Deletion</span> (Cygan et al., 2012 <span>[3]</span>).</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"186 ","pages":"Article 106493"},"PeriodicalIF":0.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140160714","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Correcting matrix products over the ring of integers","authors":"Yu-Lun Wu,&nbsp;Hung-Lung Wang","doi":"10.1016/j.ipl.2024.106496","DOIUrl":"10.1016/j.ipl.2024.106496","url":null,"abstract":"<div><p>Let <em>A</em>, <em>B</em>, and <em>C</em> be three <span><math><mi>n</mi><mo>×</mo><mi>n</mi></math></span> matrices. We investigate the problem of verifying whether <span><math><mi>A</mi><mi>B</mi><mo>=</mo><mi>C</mi></math></span> over the ring of integers and finding the correct product <em>AB</em>. Given that <em>C</em> is different from <em>AB</em> by at most <em>k</em> entries, we propose an algorithm that uses <span><math><mi>O</mi><mo>(</mo><msqrt><mrow><mi>k</mi></mrow></msqrt><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>+</mo><msup><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msup><mi>n</mi><mo>)</mo></math></span> operations. Let <em>α</em> be the largest absolute value of an entry in <em>A</em>, <em>B</em>, and <em>C</em>. The integers involved in the computation are of <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>3</mn></mrow></msup><msup><mrow><mi>α</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math></span>.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"186 ","pages":"Article 106496"},"PeriodicalIF":0.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140616211","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A linear-time algorithm for the center problem in weighted cycle graphs","authors":"Taekang Eom ,&nbsp;Hee-Kap Ahn","doi":"10.1016/j.ipl.2024.106495","DOIUrl":"https://doi.org/10.1016/j.ipl.2024.106495","url":null,"abstract":"<div><p>We study the problem of computing the center of cycle graphs whose vertices are weighted. The distance from a vertex to a point of the graph is defined as the weight of the vertex times the length of the shortest path between the vertex and the point. The weighted center of the graph is a point of the graph such that the maximum distance of the vertices of the graph to the point is minimum among all points of the graph. We present an <span><math><mi>O</mi><mo>(</mo><mi>n</mi><mo>)</mo></math></span>-time algorithm for the discrete and continuous weighted center problem on cycle graphs with <em>n</em> vertices. Our algorithm improves upon the best known algorithm that takes <span><math><mi>O</mi><mo>(</mo><mi>n</mi><mi>log</mi><mo>⁡</mo><mi>n</mi><mo>)</mo></math></span> time. Moreover, it is optimal for the weighted center problem of cycle graphs.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"186 ","pages":"Article 106495"},"PeriodicalIF":0.5,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140540027","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}