Pub Date : 2025-10-06DOI: 10.1016/j.jcss.2025.103719
Ivo F.D. Oliveira , Ricardo H.C. Takahashi
We find a searching method on ordered lists that surprisingly outperforms binary searching with respect to average query complexity while retaining minmax optimality. The method is shown to require queries on average while never exceeding queries in the worst case, i.e. the minmax bound of binary searching. Our average results assume a uniform distribution hypothesis similar to those of previous authors under which the expected query complexity of interpolation search of is known to be optimal. Hence our method turns out to be optimal with respect to both minmax and average performance. We further provide robustness guarantees and perform several numerical experiments with both artificial and real data. Our results suggest that time savings range roughly from a constant factor of 10% to 50% to a logarithmic factor spanning orders of magnitude when different metrics are considered.
{"title":"Minmax optimal list searching with log2log2n average cost","authors":"Ivo F.D. Oliveira , Ricardo H.C. Takahashi","doi":"10.1016/j.jcss.2025.103719","DOIUrl":"10.1016/j.jcss.2025.103719","url":null,"abstract":"<div><div>We find a searching method on ordered lists that surprisingly outperforms binary searching with respect to average query complexity while retaining minmax optimality. The method is shown to require <span><math><mi>O</mi><mo>(</mo><msub><mrow><mi>log</mi></mrow><mrow><mn>2</mn></mrow></msub><mo></mo><msub><mrow><mi>log</mi></mrow><mrow><mn>2</mn></mrow></msub><mo></mo><mi>n</mi><mo>)</mo></math></span> queries on average while never exceeding <span><math><mo>⌈</mo><msub><mrow><mi>log</mi></mrow><mrow><mn>2</mn></mrow></msub><mo></mo><mi>n</mi><mo>⌉</mo></math></span> queries in the worst case, i.e. the minmax bound of binary searching. Our average results assume a uniform distribution hypothesis similar to those of previous authors under which the expected query complexity of interpolation search of <span><math><mi>O</mi><mo>(</mo><msub><mrow><mi>log</mi></mrow><mrow><mn>2</mn></mrow></msub><mo></mo><msub><mrow><mi>log</mi></mrow><mrow><mn>2</mn></mrow></msub><mo></mo><mi>n</mi><mo>)</mo></math></span> is known to be optimal. Hence our method turns out to be optimal with respect to both minmax and average performance. We further provide robustness guarantees and perform several numerical experiments with both artificial and real data. Our results suggest that time savings range roughly from a constant factor of 10% to 50% to a logarithmic factor spanning orders of magnitude when different metrics are considered.</div></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"156 ","pages":"Article 103719"},"PeriodicalIF":0.9,"publicationDate":"2025-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145333257","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-10-03DOI: 10.1016/j.jcss.2025.103721
Ismaël Jecker , Nicolas Mazzocchi , Petra Wolf
A deterministic finite automaton, (DFA) is composite if its language can be expressed as the intersection of languages from smaller DFAs; otherwise, it is prime. This concept, introduced by Kupferman and Mosheiff in 2013, remains computationally challenging, with a doubly-exponential gap between the upper and lower bounds. This work focuses on permutation DFAs. We present an NP algorithm to decide compositionality and show that the difficulty stems from the number of non-accepting states. A fixed-parameter tractable algorithm is provided, using the count of rejecting states as the parameter. We further explore commutative permutation DFAs, whose structure enables decision procedures in NL and even LOGSPACE when the alphabet size is fixed. Despite this low complexity, intricate behavior persists: we provide a family of composite DFAs requiring polynomially many factors relative to their size. Additionally, we examine the k-factor composite variant — whether a DFA can be decomposed into k smaller DFAs. For commutative permutation DFAs, limiting the number of factors increases complexity, making the problem NP-complete. More generally, determining k-factor compositionality lies in PSPACE, and in LOGSPACE for DFAs over a singleton alphabet.
{"title":"Decomposing permutation automata","authors":"Ismaël Jecker , Nicolas Mazzocchi , Petra Wolf","doi":"10.1016/j.jcss.2025.103721","DOIUrl":"10.1016/j.jcss.2025.103721","url":null,"abstract":"<div><div>A deterministic finite automaton, (<span>DFA</span>) is composite if its language can be expressed as the intersection of languages from smaller <span>DFAs</span>; otherwise, it is prime. This concept, introduced by Kupferman and Mosheiff in 2013, remains computationally challenging, with a doubly-exponential gap between the upper and lower bounds. This work focuses on permutation <span>DFAs</span>. We present an <span>NP</span> algorithm to decide compositionality and show that the difficulty stems from the number of non-accepting states. A fixed-parameter tractable algorithm is provided, using the count of rejecting states as the parameter. We further explore commutative permutation <span>DFAs</span>, whose structure enables decision procedures in NL and even <span>LOGSPACE</span> when the alphabet size is fixed. Despite this low complexity, intricate behavior persists: we provide a family of composite <span>DFAs</span> requiring polynomially many factors relative to their size. Additionally, we examine the <em>k</em>-factor composite variant — whether a <span>DFA</span> can be decomposed into <em>k</em> smaller <span>DFAs</span>. For commutative permutation <span>DFAs</span>, limiting the number of factors increases complexity, making the problem NP-complete. More generally, determining <em>k</em>-factor compositionality lies in <span>PSPACE</span>, and in <span>LOGSPACE</span> for <span>DFAs</span> over a singleton alphabet.</div></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"156 ","pages":"Article 103721"},"PeriodicalIF":0.9,"publicationDate":"2025-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145333249","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-10-01DOI: 10.1016/j.jcss.2025.103720
Eva-Maria C. Hols , Stefan Kratsch, Astrid Pieterse
We extend the notion of lossy kernelization, introduced by Lokshtanov et al. (2017) [19], to approximate Turing kernelization. An α-approximate Turing kernelization for a parameterized optimization problem is a polynomial-time algorithm that, when given access to an oracle that outputs c-approximate solutions in time, computes an -approximate solution to the considered problem, using calls to the oracle of size at most for some function f that only depends on the parameter. Using this definition, we show that Independent Set parameterized by treewidth ℓ has a -approximate Turing kernelization with vertices, answering an open question posed by Lokshtanov et al. (2017) [19]. Furthermore, we give -approximate Turing kernelizations for the following graph problems parameterized by treewidth: Vertex Cover, Edge Clique Cover, Edge-Disjoint Triangle Packing, and Connected Vertex Cover. We generalize the result for Independent Set and Vertex Cover by showing that all graph problems that we will call friendly admit -approximate Turing kernelizations of polynomial size when parameterized by treewidth. We use this to establish approximate Turing kernelizations for Vertex-DisjointH-packing for connected graphs H, Clique Cover, Feedback Vertex Set, and Edge Dominating Set.
{"title":"Approximate Turing kernelization for problems parameterized by treewidth","authors":"Eva-Maria C. Hols , Stefan Kratsch, Astrid Pieterse","doi":"10.1016/j.jcss.2025.103720","DOIUrl":"10.1016/j.jcss.2025.103720","url":null,"abstract":"<div><div>We extend the notion of lossy kernelization, introduced by Lokshtanov et al. (2017) <span><span>[19]</span></span>, to approximate Turing kernelization. An <em>α</em>-approximate Turing kernelization for a parameterized optimization problem is a polynomial-time algorithm that, when given access to an oracle that outputs <em>c</em>-approximate solutions in <span><math><mi>O</mi><mo>(</mo><mn>1</mn><mo>)</mo></math></span> time, computes an <span><math><mi>α</mi><mo>⋅</mo><mi>c</mi></math></span>-approximate solution to the considered problem, using calls to the oracle of size at most <span><math><mi>f</mi><mo>(</mo><mi>k</mi><mo>)</mo></math></span> for some function <em>f</em> that only depends on the parameter. Using this definition, we show that <span>Independent Set</span> parameterized by treewidth <em>ℓ</em> has a <span><math><mo>(</mo><mn>1</mn><mo>+</mo><mi>ε</mi><mo>)</mo></math></span>-approximate Turing kernelization with <span><math><mi>O</mi><mo>(</mo><mfrac><mrow><msup><mrow><mi>ℓ</mi></mrow><mrow><mn>2</mn></mrow></msup></mrow><mrow><mi>ε</mi></mrow></mfrac><mo>)</mo></math></span> vertices, answering an open question posed by Lokshtanov et al. (2017) <span><span>[19]</span></span>. Furthermore, we give <span><math><mo>(</mo><mn>1</mn><mo>+</mo><mi>ε</mi><mo>)</mo></math></span>-approximate Turing kernelizations for the following graph problems parameterized by treewidth: <span>Vertex Cover</span>, <span>Edge Clique Cover</span>, <span>Edge-Disjoint Triangle Packing</span>, and <span>Connected Vertex Cover</span>. We generalize the result for <span>Independent Set</span> and <span>Vertex Cover</span> by showing that all graph problems that we will call <em>friendly</em> admit <span><math><mo>(</mo><mn>1</mn><mo>+</mo><mi>ε</mi><mo>)</mo></math></span>-approximate Turing kernelizations of polynomial size when parameterized by treewidth. We use this to establish approximate Turing kernelizations for <span>Vertex-Disjoint</span> <em>H</em><span>-packing</span> for connected graphs <em>H</em>, <span>Clique Cover</span>, <span>Feedback Vertex Set</span>, and <span>Edge Dominating Set</span>.</div></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"156 ","pages":"Article 103720"},"PeriodicalIF":0.9,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145227409","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-09-26DOI: 10.1016/j.jcss.2025.103717
Florian Bridoux, Aymeric Picard Marchetto, Adrien Richard
An automata network with n components over a finite alphabet Q of size q is a discrete dynamical system described by the successive iterations of a function . In most applications, the main parameter is the interaction graph of f: the digraph with vertex set that contains an arc from j to i if depends on input j. What can be said on the set of the interaction graphs of the automata networks isomorphic to f? It seems that this simple question has never been studied. In a previous paper, we prove that the complete digraph , with arcs, is universal in that whenever f is not constant nor the identity (and ). In this paper, taking the opposite direction, we prove that there exist universal automata networks f, in that contains all the digraphs on , excepted the empty one. Actually, we prove that the presence of only three specific digraphs in implies the universality of f, and we prove that this forces the alphabet size q to have at least n prime factors (with multiplicity). However, we prove that for any fixed , there exists almost universal functions, that is, functions such that the probability that a random digraph belongs to tends to 1 as . We do not know if this holds in the binary case , providing only partial results.
{"title":"Interaction graphs of isomorphic automata networks II: Universal dynamics","authors":"Florian Bridoux, Aymeric Picard Marchetto, Adrien Richard","doi":"10.1016/j.jcss.2025.103717","DOIUrl":"10.1016/j.jcss.2025.103717","url":null,"abstract":"<div><div>An automata network with <em>n</em> components over a finite alphabet <em>Q</em> of size <em>q</em> is a discrete dynamical system described by the successive iterations of a function <span><math><mi>f</mi><mo>:</mo><msup><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow></msup><mo>→</mo><msup><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow></msup></math></span>. In most applications, the main parameter is the interaction graph of <em>f</em>: the digraph with vertex set <span><math><mo>[</mo><mi>n</mi><mo>]</mo></math></span> that contains an arc from <em>j</em> to <em>i</em> if <span><math><msub><mrow><mi>f</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span> depends on input <em>j</em>. What can be said on the set <span><math><mi>G</mi><mo>(</mo><mi>f</mi><mo>)</mo></math></span> of the interaction graphs of the automata networks isomorphic to <em>f</em>? It seems that this simple question has never been studied. In a previous paper, we prove that the complete digraph <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>, with <span><math><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span> arcs, is universal in that <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>∈</mo><mi>G</mi><mo>(</mo><mi>f</mi><mo>)</mo></math></span> whenever <em>f</em> is not constant nor the identity (and <span><math><mi>n</mi><mo>≥</mo><mn>5</mn></math></span>). In this paper, taking the opposite direction, we prove that there exist universal automata networks <em>f</em>, in that <span><math><mi>G</mi><mo>(</mo><mi>f</mi><mo>)</mo></math></span> contains all the digraphs on <span><math><mo>[</mo><mi>n</mi><mo>]</mo></math></span>, excepted the empty one. Actually, we prove that the presence of only three specific digraphs in <span><math><mi>G</mi><mo>(</mo><mi>f</mi><mo>)</mo></math></span> implies the universality of <em>f</em>, and we prove that this forces the alphabet size <em>q</em> to have at least <em>n</em> prime factors (with multiplicity). However, we prove that for any fixed <span><math><mi>q</mi><mo>≥</mo><mn>3</mn></math></span>, there exists almost universal functions, that is, functions <span><math><mi>f</mi><mo>:</mo><msup><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow></msup><mo>→</mo><msup><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow></msup></math></span> such that the probability that a random digraph belongs to <span><math><mi>G</mi><mo>(</mo><mi>f</mi><mo>)</mo></math></span> tends to 1 as <span><math><mi>n</mi><mo>→</mo><mo>∞</mo></math></span>. We do not know if this holds in the binary case <span><math><mi>q</mi><mo>=</mo><mn>2</mn></math></span>, providing only partial results.</div></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"156 ","pages":"Article 103717"},"PeriodicalIF":0.9,"publicationDate":"2025-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145227408","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-09-24DOI: 10.1016/j.jcss.2025.103716
Tesshu Hanaka , Hironori Kiya , Michael Lampis , Hirotaka Ono , Kanae Yoshiwatari
Arc Kayles and Colored Arc Kayles are generalized versions of well-studied combinatorial games Cram and Domineering, respectively. In Arc Kayles, two players alternately choose an edge to remove with its adjacent edges, and the player who cannot move is the loser. Colored Arc Kayles is similarly played on a graph with edges colored in black, white, or gray, in which the black (resp., white) player can choose only a gray or black (resp., white) edge. For Arc Kayles, the vertex cover number τ (i.e., the minimum size of a vertex cover) is an essential invariant because it is known that twice the vertex cover number upper bounds the number of turns of Arc Kayles, and for the winner determination of (Colored) Arc Kayles, -time algorithms are known, where n is the number of vertices. In this paper, we first give a polynomial kernel for Colored Arc Kayles parameterized by τ, which leads to a faster -time algorithm for Colored Arc Kayles. We then focus on Arc Kayles on trees, and propose a -time algorithm. Furthermore, we show that determining the winner of Arc Kayles on a tree can be done in time, which improves the best-known running time of . Finally, we show that Colored Arc Kayles is NP-hard, the first hardness result in the family of the above games.
{"title":"Faster winner determination algorithms for (Colored) Arc Kayles","authors":"Tesshu Hanaka , Hironori Kiya , Michael Lampis , Hirotaka Ono , Kanae Yoshiwatari","doi":"10.1016/j.jcss.2025.103716","DOIUrl":"10.1016/j.jcss.2025.103716","url":null,"abstract":"<div><div><span>Arc Kayles</span> and <span>Colored Arc Kayles</span> are generalized versions of well-studied combinatorial games <span>Cram</span> and <span>Domineering</span>, respectively. In <span>Arc Kayles</span>, two players alternately choose an edge to remove with its adjacent edges, and the player who cannot move is the loser. <span>Colored Arc Kayles</span> is similarly played on a graph with edges colored in black, white, or gray, in which the black (resp., white) player can choose only a gray or black (resp., white) edge. For <span>Arc Kayles</span>, the vertex cover number <em>τ</em> (i.e., the minimum size of a vertex cover) is an essential invariant because it is known that twice the vertex cover number upper bounds the number of turns of <span>Arc Kayles</span>, and for the winner determination of <span>(Colored) Arc Kayles</span>, <span><math><msup><mrow><mn>2</mn></mrow><mrow><mi>O</mi><mo>(</mo><msup><mrow><mi>τ</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></mrow></msup><msup><mrow><mi>n</mi></mrow><mrow><mi>O</mi><mo>(</mo><mn>1</mn><mo>)</mo></mrow></msup></math></span>-time algorithms are known, where <em>n</em> is the number of vertices. In this paper, we first give a polynomial kernel for <span>Colored Arc Kayles</span> parameterized by <em>τ</em>, which leads to a faster <span><math><msup><mrow><mn>2</mn></mrow><mrow><mi>O</mi><mo>(</mo><mi>τ</mi><mi>log</mi><mo></mo><mi>τ</mi><mo>)</mo></mrow></msup><msup><mrow><mi>n</mi></mrow><mrow><mi>O</mi><mo>(</mo><mn>1</mn><mo>)</mo></mrow></msup></math></span>-time algorithm for <span>Colored Arc Kayles</span>. We then focus on <span>Arc Kayles</span> on trees, and propose a <span><math><msup><mrow><mn>2.2361</mn></mrow><mrow><mi>τ</mi></mrow></msup><msup><mrow><mi>n</mi></mrow><mrow><mi>O</mi><mo>(</mo><mn>1</mn><mo>)</mo></mrow></msup></math></span>-time algorithm. Furthermore, we show that determining the winner of <span>Arc Kayles</span> on a tree can be done in <span><math><mi>O</mi><mo>(</mo><msup><mrow><mn>1.3831</mn></mrow><mrow><mi>n</mi></mrow></msup><mo>)</mo></math></span> time, which improves the best-known running time of <span><math><mi>O</mi><mo>(</mo><msup><mrow><mn>1.4143</mn></mrow><mrow><mi>n</mi></mrow></msup><mo>)</mo></math></span>. Finally, we show that <span>Colored Arc Kayles</span> is NP-hard, the first hardness result in the family of the above games.</div></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"156 ","pages":"Article 103716"},"PeriodicalIF":0.9,"publicationDate":"2025-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145227407","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-09-24DOI: 10.1016/j.jcss.2025.103718
Karen Frilya Celine , Ziyuan Gao , Sanjay Jain , Ryan Lou , Frank Stephan , Guohua Wu
This paper studies the recursion- and automata-theoretic aspects of large-scale geometries of infinite strings, a subject initiated by Khoussainov and Takisaka (2017). We first investigate several notions of quasi-isometric reductions between recursive infinite strings and prove various results on the equivalence classes of such reductions. The main result is the construction of two infinite recursive strings α and β such that α is strictly quasi-isometrically reducible to β, but the reduction cannot be made recursive. This answers an open problem posed by Khoussainov and Takisaka. Furthermore, we also study automatic quasi-isometric reductions between automatic structures, and show that automatic quasi-isometry may be separable from general quasi-isometry depending on the growth of the automatic domain.
{"title":"Quasi-isometric reductions between infinite strings","authors":"Karen Frilya Celine , Ziyuan Gao , Sanjay Jain , Ryan Lou , Frank Stephan , Guohua Wu","doi":"10.1016/j.jcss.2025.103718","DOIUrl":"10.1016/j.jcss.2025.103718","url":null,"abstract":"<div><div>This paper studies the recursion- and automata-theoretic aspects of large-scale geometries of infinite strings, a subject initiated by Khoussainov and Takisaka (2017). We first investigate several notions of quasi-isometric reductions between recursive infinite strings and prove various results on the equivalence classes of such reductions. The main result is the construction of two infinite recursive strings <em>α</em> and <em>β</em> such that <em>α</em> is strictly quasi-isometrically reducible to <em>β</em>, but the reduction cannot be made recursive. This answers an open problem posed by Khoussainov and Takisaka. Furthermore, we also study automatic quasi-isometric reductions between automatic structures, and show that automatic quasi-isometry may be separable from general quasi-isometry depending on the growth of the automatic domain.</div></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"156 ","pages":"Article 103718"},"PeriodicalIF":0.9,"publicationDate":"2025-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145227406","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-09-23DOI: 10.1016/j.jcss.2025.103715
Juhi Chaudhary , Harmender Gahlawat , Michal Wlodarczyk , Meirav Zehavi
Given an undirected graph G and a multiset of k terminal pairs , the Vertex-Disjoint Paths () and Edge-Disjoint Paths () problems ask whether G has k pairwise internally vertex-disjoint paths and k pairwise edge-disjoint paths, respectively, connecting every terminal pair in . In this paper, we study the kernelization complexity of and on subclasses of chordal graphs. For , we design a 4k vertex kernel on split graphs and an vertex kernel on well-partitioned chordal graphs. We also show that the problem becomes polynomial-time solvable on threshold graphs. For EDP, we first prove that the problem is -complete on complete graphs. Then, we design an vertex kernel for on split graphs, and improve it to a vertex kernel on threshold graphs. Lastly, we provide an vertex kernel for on block graphs and a vertex kernel for clique paths. Our contributions improve upon several results in the literature, as well as resolve an open question by Heggernes et al. (2015) [27].
{"title":"Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs","authors":"Juhi Chaudhary , Harmender Gahlawat , Michal Wlodarczyk , Meirav Zehavi","doi":"10.1016/j.jcss.2025.103715","DOIUrl":"10.1016/j.jcss.2025.103715","url":null,"abstract":"<div><div>Given an undirected graph <em>G</em> and a multiset of <em>k</em> terminal pairs <span><math><mi>X</mi></math></span>, the <span>Vertex-Disjoint Paths</span> (<figure><img></figure>) and <span>Edge-Disjoint Paths</span> (<figure><img></figure>) problems ask whether <em>G</em> has <em>k</em> pairwise internally vertex-disjoint paths and <em>k</em> pairwise edge-disjoint paths, respectively, connecting every terminal pair in <span><math><mi>X</mi></math></span>. In this paper, we study the kernelization complexity of <figure><img></figure> and <figure><img></figure> on subclasses of chordal graphs. For <figure><img></figure>, we design a 4<em>k</em> vertex kernel on split graphs and an <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math></span> vertex kernel on well-partitioned chordal graphs. We also show that the problem becomes polynomial-time solvable on threshold graphs. For <span>EDP</span>, we first prove that the problem is <span><math><mi>NP</mi></math></span>-complete on complete graphs. Then, we design an <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>k</mi></mrow><mrow><mn>2.75</mn></mrow></msup><mo>)</mo></math></span> vertex kernel for <figure><img></figure> on split graphs, and improve it to a <span><math><mn>7</mn><mi>k</mi><mo>+</mo><mn>1</mn></math></span> vertex kernel on threshold graphs. Lastly, we provide an <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math></span> vertex kernel for <figure><img></figure> on block graphs and a <span><math><mn>2</mn><mi>k</mi><mo>+</mo><mn>1</mn></math></span> vertex kernel for clique paths. Our contributions improve upon several results in the literature, as well as resolve an open question by Heggernes et al. (2015) <span><span>[27]</span></span>.</div></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"156 ","pages":"Article 103715"},"PeriodicalIF":0.9,"publicationDate":"2025-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145227417","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-09-05DOI: 10.1016/j.jcss.2025.103703
Joshua A. Grochow , Michael Levet
We leverage the Weisfeiler–Leman algorithm for groups (Brachter & Schweitzer, LICS 2020) to improve parallel complexity upper bounds on isomorphism testing for several families of groups. We first show that groups with an Abelian normal Hall subgroup whose complement is -generated are identified by constant-dimensional Weisfeiler–Leman using -rounds. This places isomorphism testing for this family of groups into ; the previous upper bound for isomorphism testing was (Qiao, Sarma, & Tang, STACS 2011). We next use the individualize-and-refine paradigm to obtain an isomorphism test for groups without Abelian normal subgroups by circuits of depth and size , previously only known to be in (Babai, Codenotti, & Qiao, ICALP 2012) and (Chattopadhyay, Torán, & Wagner, ACM Trans. Comput. Theory, 2013). We next extend a result of Brachter & Schweitzer (ESA, 2022) on direct products of groups to the parallel setting. Namely, we how that Weisfeiler–Leman can identify direct products in parallel, provided it can identify each of the indecomposable direct factors in parallel. They previously showed the analogous result for . We finally consider the count-free Weisfeiler–Leman algorithm, where we show that count-free WL is unable to even distinguish Abelian groups in polynomial-time. Nonetheless, we use count-free WL in tandem with bounded non-determinism and limited counting to obtain a new upper bound of for isomorphism testing of Abelian groups. This improves upon the previous upper bound due to Chattopadhyay, Torán, & Wagner (ACM Trans. Comput. Theory, 2013).
{"title":"On the parallel complexity of group isomorphism via Weisfeiler–Leman","authors":"Joshua A. Grochow , Michael Levet","doi":"10.1016/j.jcss.2025.103703","DOIUrl":"10.1016/j.jcss.2025.103703","url":null,"abstract":"<div><div>We leverage the Weisfeiler–Leman algorithm for groups (Brachter & Schweitzer, LICS 2020) to improve parallel complexity upper bounds on isomorphism testing for several families of groups. We first show that groups with an Abelian normal Hall subgroup whose complement is <span><math><mi>O</mi><mo>(</mo><mn>1</mn><mo>)</mo></math></span>-generated are identified by constant-dimensional Weisfeiler–Leman using <span><math><mi>O</mi><mo>(</mo><mn>1</mn><mo>)</mo></math></span>-rounds. This places isomorphism testing for this family of groups into <span><math><mtext>L</mtext></math></span>; the previous upper bound for isomorphism testing was <span><math><mi>P</mi></math></span> (Qiao, Sarma, & Tang, STACS 2011). We next use the individualize-and-refine paradigm to obtain an isomorphism test for groups without Abelian normal subgroups by <span><math><mi>SAC</mi></math></span> circuits of depth <span><math><mi>O</mi><mo>(</mo><mi>log</mi><mo></mo><mi>n</mi><mo>)</mo></math></span> and size <span><math><msup><mrow><mi>n</mi></mrow><mrow><mi>O</mi><mo>(</mo><mi>log</mi><mo></mo><mi>log</mi><mo></mo><mi>n</mi><mo>)</mo></mrow></msup></math></span>, previously only known to be in <span><math><mi>P</mi></math></span> (Babai, Codenotti, & Qiao, ICALP 2012) and <span><math><msup><mrow><mi>quasiSAC</mi></mrow><mrow><mn>1</mn></mrow></msup></math></span> (Chattopadhyay, Torán, & Wagner, <em>ACM Trans. Comput. Theory</em>, 2013). We next extend a result of Brachter & Schweitzer (ESA, 2022) on direct products of groups to the parallel setting. Namely, we how that Weisfeiler–Leman can identify direct products in parallel, provided it can identify each of the indecomposable direct factors in parallel. They previously showed the analogous result for <span><math><mi>P</mi></math></span>. We finally consider the count-free Weisfeiler–Leman algorithm, where we show that count-free WL is unable to even distinguish Abelian groups in polynomial-time. Nonetheless, we use count-free WL in tandem with bounded non-determinism and limited counting to obtain a new upper bound of <span><math><msub><mrow><mi>β</mi></mrow><mrow><mn>1</mn></mrow></msub><msup><mrow><mtext>MAC</mtext></mrow><mrow><mn>0</mn></mrow></msup><mo>(</mo><mtext>FOLL</mtext><mo>)</mo></math></span> for isomorphism testing of Abelian groups. This improves upon the previous <span><math><msup><mrow><mtext>TC</mtext></mrow><mrow><mn>0</mn></mrow></msup><mo>(</mo><mtext>FOLL</mtext><mo>)</mo></math></span> upper bound due to Chattopadhyay, Torán, & Wagner (<em>ACM Trans. Comput. Theory</em>, 2013).</div></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"156 ","pages":"Article 103703"},"PeriodicalIF":0.9,"publicationDate":"2025-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145049766","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-09-03DOI: 10.1016/j.jcss.2025.103704
Mingyang Gong , Zhi-Zhong Chen , Guohui Lin , Lusheng Wang
This paper studies , which is to cover as many vertices as possible in a given graph by vertex-disjoint -paths (i.e., paths each with at least five vertices). is NP-hard and admits an existing local-search-based approximation algorithm which achieves a ratio of and runs in time. In this paper, we present a new approximation algorithm for which achieves a ratio of 2.511 and runs in time. Unlike the previous algorithm, the new algorithm is based on maximum matching, maximum path-cycle cover, and recursion.
{"title":"Approximately covering vertices by order-5 or longer paths","authors":"Mingyang Gong , Zhi-Zhong Chen , Guohui Lin , Lusheng Wang","doi":"10.1016/j.jcss.2025.103704","DOIUrl":"10.1016/j.jcss.2025.103704","url":null,"abstract":"<div><div>This paper studies <span><math><mi>M</mi><mi>P</mi><msubsup><mrow><mi>C</mi></mrow><mrow><mi>v</mi></mrow><mrow><mn>5</mn><mo>+</mo></mrow></msubsup></math></span>, which is to cover as many vertices as possible in a given graph <span><math><mi>G</mi><mo>=</mo><mo>(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo>)</mo></math></span> by vertex-disjoint <span><math><msup><mrow><mn>5</mn></mrow><mrow><mo>+</mo></mrow></msup></math></span>-paths (i.e., paths each with at least five vertices). <span><math><mi>M</mi><mi>P</mi><msubsup><mrow><mi>C</mi></mrow><mrow><mi>v</mi></mrow><mrow><mn>5</mn><mo>+</mo></mrow></msubsup></math></span> is NP-hard and admits an existing local-search-based approximation algorithm which achieves a ratio of <span><math><mfrac><mrow><mn>19</mn></mrow><mrow><mn>7</mn></mrow></mfrac><mo>≈</mo><mn>2.714</mn></math></span> and runs in <span><math><mi>O</mi><mo>(</mo><mo>|</mo><mi>V</mi><msup><mrow><mo>|</mo></mrow><mrow><mn>6</mn></mrow></msup><mo>)</mo></math></span> time. In this paper, we present a new approximation algorithm for <span><math><mi>M</mi><mi>P</mi><msubsup><mrow><mi>C</mi></mrow><mrow><mi>v</mi></mrow><mrow><mn>5</mn><mo>+</mo></mrow></msubsup></math></span> which achieves a ratio of 2.511 and runs in <span><math><mi>O</mi><mo>(</mo><mo>|</mo><mi>V</mi><msup><mrow><mo>|</mo></mrow><mrow><mn>2.5</mn></mrow></msup><mo>|</mo><mi>E</mi><msup><mrow><mo>|</mo></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math></span> time. Unlike the previous algorithm, the new algorithm is based on maximum matching, maximum path-cycle cover, and recursion.</div></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"156 ","pages":"Article 103704"},"PeriodicalIF":0.9,"publicationDate":"2025-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144997693","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-08-28DOI: 10.1016/j.jcss.2025.103701
David C. Kutner , Laura Larios-Jones
Given a population with dynamic pairwise connections, we ask if the entire population could be (indirectly) infected by a small group of k initially infected individuals. We formalise this problem as the Temporal Reachability Dominating Set (TaRDiS) problem on temporal graphs. We provide positive and negative parameterized complexity results in four different parameters: the number k of initially infected, the lifetime τ of the graph, the number of locally earliest edges in the graph, and the treewidth of the footprint graph . We additionally introduce and study the MaxMinTaRDiS problem, where the aim is to schedule connections between individuals so that at least k individuals must be infected for the entire population to become fully infected. We classify three variants of the problem: Strict, Nonstrict, and Happy. We show these to be coNP-complete, NP-hard, and -complete, respectively. Interestingly, we obtain hardness of the Nonstrict variant by showing that a natural restriction is exactly the well-studied Distance-3 Independent Set problem on static graphs.
{"title":"Temporal Reachability Dominating Sets: Contagion in temporal graphs","authors":"David C. Kutner , Laura Larios-Jones","doi":"10.1016/j.jcss.2025.103701","DOIUrl":"10.1016/j.jcss.2025.103701","url":null,"abstract":"<div><div>Given a population with dynamic pairwise connections, we ask if the entire population could be (indirectly) infected by a small group of <em>k</em> initially infected individuals. We formalise this problem as the <span>Temporal Reachability Dominating Set</span> (<span>TaRDiS</span>) problem on temporal graphs. We provide positive and negative parameterized complexity results in four different parameters: the number <em>k</em> of initially infected, the lifetime <em>τ</em> of the graph, the number of locally earliest edges in the graph, and the treewidth of the footprint graph <span><math><msub><mrow><mi>G</mi></mrow><mrow><mo>↓</mo></mrow></msub></math></span>. We additionally introduce and study the <span>MaxMinTaRDiS</span> problem, where the aim is to schedule connections between individuals so that at least <em>k</em> individuals must be infected for the entire population to become fully infected. We classify three variants of the problem: Strict, Nonstrict, and Happy. We show these to be coNP-complete, NP-hard, and <span><math><msubsup><mrow><mi>Σ</mi></mrow><mrow><mn>2</mn></mrow><mrow><mi>P</mi></mrow></msubsup></math></span>-complete, respectively. Interestingly, we obtain hardness of the Nonstrict variant by showing that a natural restriction is exactly the well-studied <span>Distance-3 Independent Set</span> problem on static graphs.</div></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"155 ","pages":"Article 103701"},"PeriodicalIF":0.9,"publicationDate":"2025-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144931697","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号