Journal of Computer and System Sciences最新文献_第2页

Approximate realizations for outerplanaric degree sequences 外平面度序列的近似实现

IF 1.1 3区计算机科学

Journal of Computer and System Sciences Pub Date : 2024-10-10 DOI: 10.1016/j.jcss.2024.103588

Amotz Bar-Noy , Toni Böhnlein , David Peleg , Yingli Ran , Dror Rawitz

{"title":"Approximate realizations for outerplanaric degree sequences","authors":"Amotz Bar-Noy , Toni Böhnlein , David Peleg , Yingli Ran , Dror Rawitz","doi":"10.1016/j.jcss.2024.103588","DOIUrl":"10.1016/j.jcss.2024.103588","url":null,"abstract":"<div><div>We study the question of whether a sequence <math><mi>d</mi><mo>=</mo><mo>(</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>)</mo></math> of positive integers is the degree sequence of some outerplanar graph G. If so, G is an outerplanar realization of d and d is an outerplanaric sequence. The case where <math><mo>∑</mo><mi>d</mi><mo>≤</mo><mn>2</mn><mi>n</mi><mo>−</mo><mn>2</mn></math> is easy, as d has a realization by a forest. In this paper, we consider the family <math><mi>D</mi></math> of all sequences d of even sum <math><mn>2</mn><mi>n</mi><mo>≤</mo><mo>∑</mo><mi>d</mi><mo>≤</mo><mn>4</mn><mi>n</mi><mo>−</mo><mn>6</mn><mo>−</mo><mn>2</mn><msub><mrow><mi>ω</mi></mrow><mrow><mn>1</mn></mrow></msub></math>, where <math><msub><mrow><mi>ω</mi></mrow><mrow><mi>x</mi></mrow></msub></math> is the number of x's in d. We partition <math><mi>D</mi></math> into two disjoint subfamilies, <math><mi>D</mi><mo>=</mo><msub><mrow><mi>D</mi></mrow><mrow><mi>N</mi><mi>O</mi><mi>P</mi></mrow></msub><mo>∪</mo><msub><mrow><mi>D</mi></mrow><mrow><mn>2</mn><mi>P</mi><mi>B</mi><mi>E</mi></mrow></msub></math>, such that every sequence in <math><msub><mrow><mi>D</mi></mrow><mrow><mi>N</mi><mi>O</mi><mi>P</mi></mrow></msub></math> is provably non-outerplanaric, and every sequence in <math><msub><mrow><mi>D</mi></mrow><mrow><mn>2</mn><mi>P</mi><mi>B</mi><mi>E</mi></mrow></msub></math> is given a realizing graph G enjoying a 2-page book embedding (and moreover, one of the pages is also bipartite).</div></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"148 ","pages":"Article 103588"},"PeriodicalIF":1.1,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142530102","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}

引用次数: 0

The complexity of growing a graph 图形增长的复杂性

IF 1.1 3区计算机科学

Journal of Computer and System Sciences Pub Date : 2024-09-27 DOI: 10.1016/j.jcss.2024.103587

George Mertzios , Othon Michail , George Skretas , Paul G. Spirakis , Michail Theofilatos

引用次数: 0

Priority Promotion with Parysian flair 具有 Parysian 特色的优先权推广

IF 1.1 3区计算机科学

Journal of Computer and System Sciences Pub Date : 2024-08-28 DOI: 10.1016/j.jcss.2024.103580

Massimo Benerecetti , Daniele Dell'Erba , Fabio Mogavero , Sven Schewe , Dominik Wojtczak

引用次数: 0

Adapting stable matchings to forced and forbidden pairs 使稳定配对适应强迫和禁止配对

IF 1.1 3区计算机科学

Journal of Computer and System Sciences Pub Date : 2024-08-28 DOI: 10.1016/j.jcss.2024.103579

Niclas Boehmer, Klaus Heeger

{"title":"Adapting stable matchings to forced and forbidden pairs","authors":"Niclas Boehmer, Klaus Heeger","doi":"10.1016/j.jcss.2024.103579","DOIUrl":"10.1016/j.jcss.2024.103579","url":null,"abstract":"<div>We introduce the problem of adapting a stable matching to forced and forbidden pairs. Given a stable matching <math><msub><mrow><mi>M</mi></mrow><mrow><mn>1</mn></mrow></msub></math>, a set Q of forced pairs, and a set P of forbidden pairs, we want to find a stable matching that includes all pairs from Q, no pair from P, and is as close as possible to <math><msub><mrow><mi>M</mi></mrow><mrow><mn>1</mn></mrow></msub></math>. We study this problem in four classic stable matching settings: Stable Roommates (with Ties) and Stable Marriage (with Ties). Our main contribution is a polynomial-time algorithm, based on the theory of rotations, for adapting Stable Roommates matchings to forced pairs. In contrast, we show that the same problem for forbidden pairs is NP-hard. However, our polynomial-time algorithm for forced pairs can be extended to a fixed-parameter tractable algorithm with respect to the number of forbidden pairs. Moreover, we study the setting where preferences contain ties: Some of our algorithmic results can be extended while other problems become intractable.</div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"147 ","pages":"Article 103579"},"PeriodicalIF":1.1,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0022000024000746/pdfft?md5=5e125ee369922694f684034bd2940b97&pid=1-s2.0-S0022000024000746-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142162787","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A linear algorithm for radio k-coloring of powers of paths having small diameters 小直径路径幂的无线电 k 着色线性算法

IF 1.1 3区计算机科学

Journal of Computer and System Sciences Pub Date : 2024-08-26 DOI: 10.1016/j.jcss.2024.103577

Dipayan Chakraborty , Soumen Nandi , Sagnik Sen , D.K. Supraja

{"title":"A linear algorithm for radio k-coloring of powers of paths having small diameters","authors":"Dipayan Chakraborty , Soumen Nandi , Sagnik Sen , D.K. Supraja","doi":"10.1016/j.jcss.2024.103577","DOIUrl":"10.1016/j.jcss.2024.103577","url":null,"abstract":"<div>The radio k-chromatic number <math><mi>r</mi><msub><mrow><mi>c</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo></math> of a graph G is the minimum integer λ such that there exists a function <math><mi>ϕ</mi><mo>:</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>→</mo><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mo>⋯</mo><mo>,</mo><mi>λ</mi><mo>}</mo></math> satisfying <math><mo>|</mo><mi>ϕ</mi><mo>(</mo><mi>u</mi><mo>)</mo><mo>−</mo><mi>ϕ</mi><mo>(</mo><mi>v</mi><mo>)</mo><mo>|</mo><mo>≥</mo><mi>k</mi><mo>+</mo><mn>1</mn><mo>−</mo><mi>d</mi><mo>(</mo><mi>u</mi><mo>,</mo><mi>v</mi><mo>)</mo></math>, where <math><mi>d</mi><mo>(</mo><mi>u</mi><mo>,</mo><mi>v</mi><mo>)</mo></math> denotes the distance between u and v. A considerable amount of attention has been given to find the exact values or providing polynomial time algorithms to determine <math><mi>r</mi><msub><mrow><mi>c</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo></math> for several basic graph families such as paths, cycles, trees, and powers of paths, usually for some specific values of k. In this article, we find the exact values of <math><mi>r</mi><msub><mrow><mi>c</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo></math> where G is a power of a path with diameter strictly less than k. Our proof readily provides a linear time algorithm for assigning a radio k-coloring of G. Furthermore, our proof technique is a potential tool for solving the same problem for other classes of graphs having “small” diameters.</div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"147 ","pages":"Article 103577"},"PeriodicalIF":1.1,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142136727","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}

引用次数: 0

On finding short reconfiguration sequences between independent sets 关于在独立集合之间寻找短重组序列

IF 1.1 3区计算机科学

Journal of Computer and System Sciences Pub Date : 2024-08-23 DOI: 10.1016/j.jcss.2024.103578

Akanksha Agrawal , Soumita Hait , Amer E. Mouawad

{"title":"On finding short reconfiguration sequences between independent sets","authors":"Akanksha Agrawal , Soumita Hait , Amer E. Mouawad","doi":"10.1016/j.jcss.2024.103578","DOIUrl":"10.1016/j.jcss.2024.103578","url":null,"abstract":"<div>Token Sliding Optimization asks whether there exists a sequence of at most ℓ steps that transforms independent set S into T, where at each step a token slides to an unoccupied neighboring vertex (while maintaining independence). In Token Jumping Optimization, we are instead allowed to jump from a vertex to any unoccupied vertex. Both problems are known to be FPT when parameterized by ℓ on nowhere dense graphs. In this work, we show that both problems are FPT for parameter <math><mi>k</mi><mo>+</mo><mi>ℓ</mi><mo>+</mo><mi>d</mi></math> on d-degenerate graphs as well as for parameter <math><mo>|</mo><mi>M</mi><mo>|</mo><mo>+</mo><mi>ℓ</mi><mo>+</mo><mi>Δ</mi></math> on graphs having a modulator M to maximum degree Δ. We complement these results by showing that for parameter ℓ both problems become hard already on 2-degenerate graphs. Finally, we show that using such families one can obtain a unified algorithm for the standard Token Jumping problem parameterized by k on degenerate and nowhere dense graphs.</div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"147 ","pages":"Article 103578"},"PeriodicalIF":1.1,"publicationDate":"2024-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142084354","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}

引用次数: 0

Minimum separator reconfiguration 最小分离器重新配置

IF 1.1 3区计算机科学

Journal of Computer and System Sciences Pub Date : 2024-07-29 DOI: 10.1016/j.jcss.2024.103574

Guilherme C.M. Gomes , Clément Legrand-Duchesne , Reem Mahmoud , Amer E. Mouawad , Yoshio Okamoto , Vinicius F. dos Santos , Tom C. van der Zanden

{"title":"Minimum separator reconfiguration","authors":"Guilherme C.M. Gomes , Clément Legrand-Duchesne , Reem Mahmoud , Amer E. Mouawad , Yoshio Okamoto , Vinicius F. dos Santos , Tom C. van der Zanden","doi":"10.1016/j.jcss.2024.103574","DOIUrl":"10.1016/j.jcss.2024.103574","url":null,"abstract":"<div>We study the problem of reconfiguring s-t-separators on finite simple graphs. We consider several variants of the problem, focusing on the token sliding and jumping models. We begin with a polynomial-time algorithm that computes (if one exists) a shortest sequence of slides and another that decides if a sequence of jumps exists and outputs a witnessing sequence. We also show that deciding if a reconfiguration sequence of at most ℓ jumps exists is an <math><mtext>NP</mtext></math>-complete problem. To complement this result, we investigate the parameterized complexity of the natural parameterizations of the problem: by the size k of the minimum s-t-separators and by the number of jumps ℓ. We show that the problem is in FPT parameterized by k, but that it does not admit a polynomial kernel unless <math><mtext>NP</mtext><mo>⊆</mo><mtext>coNP/poly</mtext></math>. Our final result is a kernel with <math><mi>O</mi><mo>(</mo><msup><mrow><mi>ℓ</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math> vertices and edges.</div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"146 ","pages":"Article 103574"},"PeriodicalIF":1.1,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141936525","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}

引用次数: 0

Towards declarative comparabilities: Application to functional dependencies 实现声明式比较：应用于功能依赖性

IF 1.1 3区计算机科学

Journal of Computer and System Sciences Pub Date : 2024-07-29 DOI: 10.1016/j.jcss.2024.103576

Lhouari Nourine , Jean-Marc Petit , Simon Vilmin

引用次数: 0

Modular SAT-based techniques for reasoning tasks in team semantics 基于模块化 SAT 的团队语义推理任务技术

IF 1.1 3区计算机科学

Journal of Computer and System Sciences Pub Date : 2024-07-25 DOI: 10.1016/j.jcss.2024.103575

Arnaud Durand , Juha Kontinen , Jouko Väänänen

引用次数: 0

The complexity of computing optimum labelings for temporal connectivity 计算时空连通性最佳标签的复杂性

IF 1.1 3区计算机科学

Journal of Computer and System Sciences Pub Date : 2024-07-09 DOI: 10.1016/j.jcss.2024.103564

Nina Klobas , George B. Mertzios , Hendrik Molter , Paul G. Spirakis

{"title":"The complexity of computing optimum labelings for temporal connectivity","authors":"Nina Klobas , George B. Mertzios , Hendrik Molter , Paul G. Spirakis","doi":"10.1016/j.jcss.2024.103564","DOIUrl":"10.1016/j.jcss.2024.103564","url":null,"abstract":"<div>A graph is temporally connected if a strict temporal path exists from every vertex u to every other vertex v. This paper studies temporal design problems for undirected temporally connected graphs. Given a connected undirected graph G, the goal is to determine the smallest total number of time-labels <math><mo>|</mo><mi>λ</mi><mo>|</mo></math> needed to ensure temporal connectivity, where <math><mo>|</mo><mi>λ</mi><mo>|</mo></math> denotes the sum, over all edges, of the size of the set of labels associated to an edge. The basic problem, called Minimum Labeling (ML) can be solved optimally in polynomial time. We introduce the Min. Aged Labeling (MAL) problem, which involves connecting the graph with an upper-bound on the maximum label, the Min. Steiner Labeling (MSL) problem, focusing on connecting specific important vertices, and the age-restricted version of MSL, Min. Aged Steiner Labeling (MASL). We show that MAL is NP-complete, MASL is W[1]-hard, and while MSL remains NP-hard, it is FPT with respect to the number of terminals.</div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"146 ","pages":"Article 103564"},"PeriodicalIF":1.1,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S002200002400059X/pdfft?md5=47d92c214e02fc0c658d2c49a1fdf6d8&pid=1-s2.0-S002200002400059X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141719050","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0