Acta Informatica最新文献

{"title":"Parameterized aspects of distinct Kemeny rank aggregation","authors":"Koustav De,&nbsp;Harshil Mittal,&nbsp;Palash Dey,&nbsp;Neeldhara Misra","doi":"10.1007/s00236-024-00463-x","DOIUrl":"10.1007/s00236-024-00463-x","url":null,"abstract":"<div><p>The Kemeny method is one of the popular tools for rank aggregation. However, computing an optimal Kemeny ranking is <span>(textsf{NP})</span>-hard. Consequently, the computational task of finding a Kemeny ranking has been studied under the lens of parameterized complexity with respect to many parameters. We study the parameterized complexity of the problem of computing all distinct Kemeny rankings. We consider the target Kemeny score, number of candidates, average distance of input rankings, maximum range of any candidate, and unanimity width as our parameters. For all these parameters, we already have <span>(textsf{FPT})</span> algorithms. We find that any desirable number of Kemeny rankings can also be found without substantial increase in running time. We also present <span>(textsf{FPT})</span> approximation algorithms for Kemeny rank aggregation with respect to these parameters.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 4","pages":"401 - 414"},"PeriodicalIF":0.4,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142209385","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":"Word-representable graphs from a word’s perspective","authors":"Pamela Fleischmann,&nbsp;Lukas Haschke,&nbsp;Tim Löck,&nbsp;Dirk Nowotka","doi":"10.1007/s00236-024-00462-y","DOIUrl":"10.1007/s00236-024-00462-y","url":null,"abstract":"<div><p>Word-representable graphs were introduced in 2008 by Kitaev and Pyatkin in the context of semigroup theory. Graphs are called word-representable if there exists a word with the graph’s nodes as letters such that the letters in the word alternate iff there is an edge between them in the graph. Until today numerous works investigated the word-representability of graphs but mostly from the graph perspective. In this work, we change the perspective to the words, i.e., we take classes of words and investigate the represented graphs. Our first subject of interest are the conjugates of words: we determine exactly which graphs are represented if we rotate the word. Afterwards, we look at <i>k</i>-local words introduced by Day et al. (FSTTCS LIPIcs, 2017) in order to gain more insights into this class of words. Here, we investigate especially which graphs are represented by 1-local words. Lastly, we prove that the language of all words representing a graph is regular. We were also able to characterise <i>k</i>-representable graphs, solving an open problem.\u0000</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 4","pages":"383 - 400"},"PeriodicalIF":0.4,"publicationDate":"2024-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-024-00462-y.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141937303","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":"A closer look at Hamiltonicity and domination through the lens of diameter and convexity","authors":"R. Mahendra Kumar,&nbsp;N. Sadagopan","doi":"10.1007/s00236-024-00461-z","DOIUrl":"10.1007/s00236-024-00461-z","url":null,"abstract":"&lt;div&gt;&lt;p&gt;A bipartite graph &lt;i&gt;G&lt;/i&gt;(&lt;i&gt;X&lt;/i&gt;, &lt;i&gt;Y&lt;/i&gt;) is called a star-convex bipartite graph with convexity on &lt;i&gt;X&lt;/i&gt; if there is an associated star &lt;i&gt;T&lt;/i&gt;(&lt;i&gt;X&lt;/i&gt;, &lt;i&gt;F&lt;/i&gt;), such that for each vertex in &lt;i&gt;Y&lt;/i&gt;, its neighborhood in &lt;i&gt;X&lt;/i&gt; induces a subtree in &lt;i&gt;T&lt;/i&gt;. A graph &lt;i&gt;G&lt;/i&gt; is said to be a split graph if &lt;i&gt;G&lt;/i&gt; can be partitioned into a clique (&lt;i&gt;K&lt;/i&gt;) and an independent set (&lt;i&gt;I&lt;/i&gt;). The objective of this study is twofold: (i) to strengthen the complexity results presented in Chen et al. (J Comb Optim 32(1):95–110, 2016) for the Hamiltonian cycle (HCYCLE), the Hamiltonian path (HPATH), and the Domination (DS) problems on star-convex bipartite graphs (ii) to reinforce the results of Müller (Discret Math 156(1–3):291–298, 1996) for HCYCLE, and HPATH on split graphs by introducing a convex ordering on one of the partitions (&lt;i&gt;K&lt;/i&gt; or &lt;i&gt;I&lt;/i&gt;). As part of our fine-grained analysis study with the diameter being the parameter, we first show that the diameter of star-convex bipartite graphs is at most six. Next, we observe that the reduction instances of Chen et al. (J Comb Optim 32(1):95–110, 2016) are star-convex bipartite graphs with at most diameter 4, and hence HCYCLE and HPATH are NP-complete on star-convex bipartite graphs with at most diameter 4. We strengthen this result and establish the following results on star-convex bipartite graphs: (i) HCYCLE is NP-complete for diameter 3, and polynomial-time solvable for diameters 2, 5, and 6 (a transformation in complexity: P to NPC to P) (ii) HPATH is polynomial-time solvable for diameter 2, and NP-Complete, otherwise (a dichotomy). Further, with convexity being the parameter, for split graphs with convexity on &lt;i&gt;K&lt;/i&gt; (resp. &lt;i&gt;I&lt;/i&gt;), we show that HCYCLE and HPATH are NP-complete on star-convex (resp. comb) split graphs with convexity on &lt;i&gt;K&lt;/i&gt; (resp. &lt;i&gt;I&lt;/i&gt;). Further, we show that HCYCLE is NP-complete on &lt;span&gt;(k_{1,r})&lt;/span&gt;-free star-convex split graphs with convexity on &lt;i&gt;I&lt;/i&gt;, &lt;span&gt;(rge 6)&lt;/span&gt;. On the positive side, we show that for &lt;span&gt;(K_{1,5})&lt;/span&gt;-free star-convex split graphs with convexity on &lt;i&gt;I&lt;/i&gt;, HCYCLE is polynomial-time solvable. Thus, we establish a dichotomy for HCYCLE on star-convex split graphs with convexity on &lt;i&gt;I&lt;/i&gt;. We further show that the dominating set problem (DS) and its variants (resp. Connected, Total, Outer-Connected, and Dominating biclique) are NP-complete on star-convex bipartite graphs with diameter 3 (resp. diameter 5, and diameter 6). On the parameterized complexity front, we prove that the parameterized version of the domination problem and its variants, with the parameter being the solution size, is not fixed-parameter tractable for star-convex bipartite graphs with diameter 3 (resp. diameter 5, and diameter 6), whereas it is fixed-parameter tractable when the parameter is the number of leaves in the associated star. Further, we show that for star-convex bipartite graphs with diameters 5, and 6, the domin","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 4","pages":"357 - 382"},"PeriodicalIF":0.4,"publicationDate":"2024-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141937307","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":"Cycle encoding-based parameter synthesis for timed automata safety","authors":"Burkay Sucu,&nbsp;Ebru Aydin Gol","doi":"10.1007/s00236-024-00460-0","DOIUrl":"10.1007/s00236-024-00460-0","url":null,"abstract":"<div><p>Parametric timed automata (PTA) extend timed automata (TA) with parameters instead of fixed timing constraints, providing the flexibility to accommodate uncertainties during the design phase. Once a parametric model is obtained, the next step is finding the optimal parameters such that the resulting TA satisfies the specifications. This paper introduces a new algorithm for determining parameters from safety specifications for PTA with bounded integer parameters and no nested cycles. The algorithm searches for unsafe paths through a depth-first search and generates parameter constraints. In particular, the realizability of simple and cyclic paths are encoded via mixed integer linear programming and non-linear programming problems. Then, the parameter constraints rendering the path unrealizable are derived via quantifier elimination. The accumulated constraints through the depth-first search guarantee that a parameter valuation satisfying these constraints solves the synthesis problem. The results are illustrated over benchmarks.\u0000</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 4","pages":"333 - 356"},"PeriodicalIF":0.4,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141868296","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 longest letter-duplicated subsequence and related problems","authors":"Wenfeng Lai,&nbsp;Adiesha Liyanage,&nbsp;Binhai Zhu,&nbsp;Peng Zou","doi":"10.1007/s00236-024-00459-7","DOIUrl":"10.1007/s00236-024-00459-7","url":null,"abstract":"<div><p>Motivated by computing duplication patterns in sequences, a new problem called the longest letter-duplicated subsequence (LLDS) is proposed. Given a sequence <i>S</i> of length <i>n</i>, a letter-duplicated subsequence is a subsequence of <i>S</i> in the form of <span>(x_1^{d_1}x_2^{d_2}ldots x_k^{d_k})</span> with <span>(x_iin Sigma )</span>, <span>(x_jne x_{j+1})</span> and <span>(d_ige 2)</span> for all <i>i</i> in [<i>k</i>] and <i>j</i> in <span>([k-1])</span>. A linear time algorithm for computing a longest letter-duplicated subsequence (LLDS) of <i>S</i> can be easily obtained. In this paper, we focus on two variants of this problem: (1) ‘all-appearance’ version, i.e., all letters in <span>(Sigma )</span> must appear in the solution, and (2) the weighted version. For the former, we obtain dichotomous results: We prove that, when each letter appears in <i>S</i> at least 4 times, the problem and a relaxed version on feasibility testing (FT) are both NP-hard. The reduction is from <span>((3^+,1,2^-))</span>-SAT, where all 3-clauses (i.e., containing 3 lals) are monotone (i.e., containing only positive literals) and all 2-clauses contain only negative literals. We then show that when each letter appears in <i>S</i> at most 3 times, then the problem admits an <i>O</i>(<i>n</i>) time algorithm. Finally, we consider the weighted version, where the weight of a block <span>(x_i^{d_i} (d_ige 2))</span> could be any positive function which might not grow with <span>(d_i)</span>. We give a non-trivial <span>(O(n^2))</span> time dynamic programming algorithm for this version, i.e., computing an LD-subsequence of <i>S</i> whose weight is maximized.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 3","pages":"315 - 329"},"PeriodicalIF":0.4,"publicationDate":"2024-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-024-00459-7.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141741186","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":"Invariant relations for affine loops","authors":"Wided Ghardallou,&nbsp;Hessamaldin Mohammadi,&nbsp;Richard C. Linger,&nbsp;Mark Pleszkoch,&nbsp;JiMeng Loh,&nbsp;Ali Mili","doi":"10.1007/s00236-024-00457-9","DOIUrl":"10.1007/s00236-024-00457-9","url":null,"abstract":"<div><p>Invariant relations are used to analyze while loops; while their primary application is to derive the function of a loop, they can also be used to derive loop invariants, weakest preconditions, strongest postconditions, sufficient conditions of correctness, necessary conditions of correctness, and termination conditions of loops. In this paper we present two generic invariant relations that capture the semantics of loops whose loop body applies affine transformations on numeric variables.\u0000</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 3","pages":"261 - 314"},"PeriodicalIF":0.4,"publicationDate":"2024-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-024-00457-9.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140930753","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":"Reachability analysis of linear systems","authors":"Shiping Chen,&nbsp;Xinyu Ge","doi":"10.1007/s00236-024-00458-8","DOIUrl":"10.1007/s00236-024-00458-8","url":null,"abstract":"<div><p>In this paper, we propose a decision procedure of reachability for a linear system <span>(xi '=Axi +u)</span>, where the matrix <span>(A's)</span> eigenvalues can be arbitrary algebraic number and the input <i>u</i> is a vector of trigonometric-exponential polynomials. If the initial set contains only one point, the reachability problem under consideration is reduced to the decidability of the sign of trigonometric-exponential polynomial and then achieved by being reduced to verification of a series of univariate polynomial inequalities through Taylor expansions of the related exponential functions and trigonometric functions. If the initial set is open semi-algebraic, we will propose a decision procedure based on OpenCAD and an algorithm of real root isolation derived from the sign-deciding procedure for the trigonometric-exponential polynomials. The experimental results indicate the efficiency of our approach. Under the assumption of Schanuel’s Conjecture, the above procedures are complete for bounded time except for several cases.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 3","pages":"231 - 260"},"PeriodicalIF":0.4,"publicationDate":"2024-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140568440","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":"Revisiting 2–3 red–black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking","authors":"Kamaledin Ghiasi-Shirazi,&nbsp;Taraneh Ghandi,&nbsp;Ali Taghizadeh,&nbsp;Ali Rahimi-Baigi","doi":"10.1007/s00236-023-00452-6","DOIUrl":"10.1007/s00236-023-00452-6","url":null,"abstract":"<div><p>Red–black (RB) trees are one of the most efficient variants of balanced binary search trees. However, they have often been criticized for being too complicated, hard to explain, and unsuitable for pedagogical purposes, particularly their delete operation. Sedgewick (in: Dagstuhl Workshop on Data Structures, 2008. https://sedgewick.io/wp-content/themes/sedgewick/papers/2008LLRB.pdf) identified the length of code as the root of the problems and introduced left-leaning red–black (LLRB) trees. The delete operation of LLRB trees has a compact recursive code. Unfortunately, it may perform many unnecessary operations. The crux of the deletion algorithm is dealing with a “deficient” subtree, that is one whose black-height has become one less than that of its sibling subtree. In this paper, we revisit 2–3 red–black trees and propose a parity-seeking delete algorithm with the basic idea of making a deficient subtree on a par with its sibling: either by fixing the deficient subtree or by turning the sibling deficient as well, ascending deficiency to the parent node. Interestingly, the proposed parity-seeking <i>delete</i> algorithm also works for 2–3–4 RB trees. Our experiments show that the proposed parity-seeking delete algorithm is as efficient as the best preceding RB trees. The proposed parity-seeking delete algorithm is easily understandable and suitable for pedagogical and practical purposes.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 3","pages":"199 - 229"},"PeriodicalIF":0.4,"publicationDate":"2024-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140325649","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":"Distance-edge-monitoring sets of networks","authors":"Gang Yang,&nbsp;Jiannan Zhou,&nbsp;Changxiang He,&nbsp;Yaping Mao","doi":"10.1007/s00236-024-00453-z","DOIUrl":"10.1007/s00236-024-00453-z","url":null,"abstract":"<div><p>It is important to be able to monitor the network and detect this failure when a connection (an edge) fails. For a vertex set <i>M</i> and an edge <i>e</i> of the graph <i>G</i>, let <i>P</i>(<i>M</i>, <i>e</i>) be the set of pairs (<i>x</i>, <i>y</i>) with a vertex <i>x</i> of <i>M</i> and a vertex <i>y</i> of <i>V</i>(<i>G</i>) such that <i>e</i> belongs to all shortest paths between <i>x</i> and <i>y</i>. A vertex set <i>M</i> of the graph <i>G</i> is <i>distance-edge-monitoring set</i> if every edge <i>e</i> of <i>G</i> is monitored by some vertex of <i>M</i>, that is, the set <i>P</i>(<i>M</i>, <i>e</i>) is nonempty. The distance-edge-monitoring number of a graph <i>G</i>, recently introduced by Foucaud, Kao, Klasing, Miller, and Ryan, is defined as the smallest size of distance-edge-monitoring sets of <i>G</i>. In this paper, we determine the bounds of the distance-edge-monitoring number of grid-based pyramids and the exact value of distance-edge-monitoring number for <i>M</i>(<i>t</i>)-graph and Sierpiński-type graphs. We also compare the distance-edge-monitoring set with average degree, the size of edge set and the size of vertex set of <i>G</i>, where <i>G</i> is <i>M</i>(<i>t</i>)-graph or Sierpiński-type graphs.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 2","pages":"183 - 198"},"PeriodicalIF":0.4,"publicationDate":"2024-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140197909","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":"An encoding of the (lambda )-calculus in the String MultiSet Rewriting calculus","authors":"Attila Bagossy,&nbsp;Péter Battyányi","doi":"10.1007/s00236-024-00456-w","DOIUrl":"10.1007/s00236-024-00456-w","url":null,"abstract":"<div><p>In this paper, we present an encoding of the <span>(lambda )</span>-calculus in a multiset rewriting system and provide a few applications of the construction. For this purpose, we choose the calculus named String MultiSet Rewriting, which was introduced in Barbuti et al. (Electron Notes Theor Comput Sci 194:19–34, 2008) by Barbuti et al. With the help of our encoding, we give alternative proofs for the standardization and the finiteness of developments theorems in the <span>(lambda )</span>-calculus.\u0000</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 2","pages":"161 - 181"},"PeriodicalIF":0.4,"publicationDate":"2024-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00236-024-00456-w.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140126198","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}