发布求助
文献互助 智能选刊 最新文献

Journal of Computer and System Sciences最新文献

筛选
英文 中文
On computing large temporal (unilateral) connected components 关于计算大时间（单边）连接成分
IF 1.1 3区 计算机科学
Journal of Computer and System Sciences Pub Date : 2024-05-22 DOI: 10.1016/j.jcss.2024.103548
Isnard Lopes Costa , Raul Lopes , Andrea Marino , Ana Silva
{"title":"On computing large temporal (unilateral) connected components","authors":"Isnard Lopes Costa ,&nbsp;Raul Lopes ,&nbsp;Andrea Marino ,&nbsp;Ana Silva","doi":"10.1016/j.jcss.2024.103548","DOIUrl":"https://doi.org/10.1016/j.jcss.2024.103548","url":null,"abstract":"<div><p>A temporal (directed) graph is one where edges are available only at specific times during its lifetime, <em>τ</em>. Paths in these graphs are sequences of adjacent edges whose appearing times are either strictly increasing or non-strictly increasing. Classical concepts of connected and unilateral components can be naturally extended to temporal graphs. We address fundamental questions in temporal graphs. (i) What is the complexity of deciding the existence of a component of size <em>k</em>, parameterized by <em>τ</em>, <em>k</em>, and <span><math><mi>k</mi><mo>+</mo><mi>τ</mi></math></span>? The answer depends on the component definition and whether the graph is directed or undirected. (ii) What is the minimum running time to check if a subset of vertices is pairwise reachable? A quadratic-time algorithm exists, but a faster time is unlikely unless <span>SETH</span> fails. (iii) Can we verify if a subset of vertices forms a component in polynomial time? This is <span>NP</span> -complete depending on the temporal component definition.</p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"144 ","pages":"Article 103548"},"PeriodicalIF":1.1,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141244778","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
Backdoor DNFs 后门 DNF
IF 1.1 3区 计算机科学
Journal of Computer and System Sciences Pub Date : 2024-05-21 DOI: 10.1016/j.jcss.2024.103547
Sebastian Ordyniak , Andre Schidler , Stefan Szeider
{"title":"Backdoor DNFs","authors":"Sebastian Ordyniak ,&nbsp;Andre Schidler ,&nbsp;Stefan Szeider","doi":"10.1016/j.jcss.2024.103547","DOIUrl":"10.1016/j.jcss.2024.103547","url":null,"abstract":"<div><p>We introduce backdoor DNFs, as a tool to measure the theoretical hardness of CNF formulas. Like backdoor sets and backdoor trees, backdoor DNFs are defined relative to a tractable class of CNF formulas. Each conjunctive term of a backdoor DNF defines a partial assignment that moves the input CNF formula into the base class. Backdoor DNFs are more expressive and potentially smaller than their predecessors backdoor sets and backdoor trees. We establish the fixed-parameter tractability of the backdoor DNF detection problem. Our results hold for the fundamental base classes Horn and 2CNF, and their combination. We complement our theoretical findings by an empirical study. Our experiments show that backdoor DNFs provide a significant improvement over their predecessors.</p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"144 ","pages":"Article 103547"},"PeriodicalIF":1.1,"publicationDate":"2024-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0022000024000424/pdfft?md5=28e392df06776d3baaabe0cd651c38e8&pid=1-s2.0-S0022000024000424-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141150054","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
Temporal reachability minimization: Delaying vs. deleting 时间可达性最小化：延迟与删除
IF 1.1 3区 计算机科学
Journal of Computer and System Sciences Pub Date : 2024-05-20 DOI: 10.1016/j.jcss.2024.103549
Hendrik Molter , Malte Renken , Philipp Zschoche
{"title":"Temporal reachability minimization: Delaying vs. deleting","authors":"Hendrik Molter ,&nbsp;Malte Renken ,&nbsp;Philipp Zschoche","doi":"10.1016/j.jcss.2024.103549","DOIUrl":"https://doi.org/10.1016/j.jcss.2024.103549","url":null,"abstract":"<div><p>We study spreading processes in temporal graphs, that is, graphs whose connections change over time. More precisely, we investigate how such a spreading process, emerging from a given set of sources, can be contained to a small part of the graph. We consider two ways of modifying the graph, which are (1) deleting and (2) delaying connections. We show a close relationship between the two associated problems. It is known that both problems are W[1]-hard when parameterized by the number of modifications. We consider the number of vertices to which the spread is contained as a parameter. Surprisingly, we prove W[1]-hardness for the deletion variant but fixed-parameter tractability for the delaying variant. Furthermore, we give a polynomial time algorithm for both problem variants when the graph has a tree structure and show how to generalize this result to an FPT-algorithm for the so-called timed feedback vertex number as a parameter.</p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"144 ","pages":"Article 103549"},"PeriodicalIF":1.1,"publicationDate":"2024-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141156323","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
A new temporal interpretation of cluster editing 集群编辑的新时间解释
IF 1.1 3区 计算机科学
Journal of Computer and System Sciences Pub Date : 2024-05-17 DOI: 10.1016/j.jcss.2024.103551
Cristiano Bocci , Chiara Capresi , Kitty Meeks , John Sylvester
{"title":"A new temporal interpretation of cluster editing","authors":"Cristiano Bocci ,&nbsp;Chiara Capresi ,&nbsp;Kitty Meeks ,&nbsp;John Sylvester","doi":"10.1016/j.jcss.2024.103551","DOIUrl":"https://doi.org/10.1016/j.jcss.2024.103551","url":null,"abstract":"<div><p>The <span><math><mi>NP</mi></math></span>-complete graph problem <span>Cluster Editing</span> seeks to transform a static graph into a disjoint union of cliques by making the fewest possible edits to the edges. We introduce a natural interpretation of this problem in temporal graphs, whose edge sets change over time. This problem is <span><math><mi>NP</mi></math></span>-complete even when restricted to temporal graphs whose underlying graph is a path, but we obtain two polynomial-time algorithms for restricted cases. In the static setting, it is well-known that a graph is a disjoint union of cliques if and only if it contains no induced copy of <span><math><msub><mrow><mi>P</mi></mrow><mrow><mn>3</mn></mrow></msub></math></span>; we demonstrate that no general characterisation involving sets of at most four vertices can exist in the temporal setting, but obtain a complete characterisation involving forbidden configurations on at most five vertices. This characterisation gives rise to an <span><math><mi>FPT</mi></math></span> algorithm parameterised simultaneously by the permitted number of modifications and the lifetime of the temporal graph.</p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"144 ","pages":"Article 103551"},"PeriodicalIF":1.1,"publicationDate":"2024-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0022000024000461/pdfft?md5=3c7ceb30b0bccaa972030b25aefb334f&pid=1-s2.0-S0022000024000461-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141156308","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
The tree-child network inference problem for line trees and the shortest common supersequence problem for permutation strings 线状树的树-子网络推理问题和排列字符串的最短公共超序列问题
IF 1.1 3区 计算机科学
Journal of Computer and System Sciences Pub Date : 2024-05-16 DOI: 10.1016/j.jcss.2024.103546
Laurent Bulteau , Louxin Zhang
{"title":"The tree-child network inference problem for line trees and the shortest common supersequence problem for permutation strings","authors":"Laurent Bulteau ,&nbsp;Louxin Zhang","doi":"10.1016/j.jcss.2024.103546","DOIUrl":"10.1016/j.jcss.2024.103546","url":null,"abstract":"<div><p>One strategy for inference of phylogenetic networks is to solve the phylogenetic network problem, which involves inferring phylogenetic trees first and subsequently computing the smallest phylogenetic network that displays all the trees. This approach capitalizes on exceptional tools available for inferring phylogenetic trees from biomolecular sequences. Since the vast space of phylogenetic networks poses difficulties in obtaining comprehensive sampling, the researchers switch their attention to inferring tree-child networks from multiple phylogenetic trees, where in a tree-child network each non-leaf node must have at least one child that is an indegree-one node. Three results are obtained in this work: (1) The shortest common supersequence problem remains NP-hard even for permutation strings. (2) Derived from the first result, the tree-child network inference problem is also established as NP-hard even for line trees (also known as <em>caterpillar</em> trees). (3) The parsimonious tree-child networks that display all the line trees are the same as those displaying all the binary trees and their hybridization number is <span><math><mi>Θ</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>3</mn></mrow></msup><mo>)</mo></math></span> for <em>n</em> taxa.</p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"144 ","pages":"Article 103546"},"PeriodicalIF":1.1,"publicationDate":"2024-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141049268","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 minimum vertex bisection of random d-regular graphs 论随机 d-Regular 图形的最小顶点平分
IF 1.1 3区 计算机科学
Journal of Computer and System Sciences Pub Date : 2024-05-15 DOI: 10.1016/j.jcss.2024.103550
Josep Díaz , Öznur Yaşar Diner , Maria Serna , Oriol Serra
{"title":"On minimum vertex bisection of random d-regular graphs","authors":"Josep Díaz ,&nbsp;Öznur Yaşar Diner ,&nbsp;Maria Serna ,&nbsp;Oriol Serra","doi":"10.1016/j.jcss.2024.103550","DOIUrl":"10.1016/j.jcss.2024.103550","url":null,"abstract":"<div><p>Minimum vertex bisection is a graph partitioning problem in which the aim is to find a partition of the vertices into two equal parts that minimizes the number of vertices in one partition set that have a neighbor in the other set. In this work we are interested in providing asymptotically almost surely upper bounds on the minimum vertex bisection of random <em>d</em>-regular graphs, for constant values of <em>d</em>. Our approach is based on analyzing a greedy algorithm by using the differential equation method. In this way, we obtain the first known non-trivial upper bounds for the vertex bisection number in random regular graphs. The numerical approximations of these theoretical bounds are compared with the emprical ones, and with the lower bounds from Kolesnik and Wormald (2014) <span>[30]</span>.</p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"144 ","pages":"Article 103550"},"PeriodicalIF":1.1,"publicationDate":"2024-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S002200002400045X/pdfft?md5=5ad9b857ac0144723c133211748957a5&pid=1-s2.0-S002200002400045X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141027925","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
Online computation with untrusted advice 使用不可靠建议的在线计算
IF 1.1 3区 计算机科学
Journal of Computer and System Sciences Pub Date : 2024-04-18 DOI: 10.1016/j.jcss.2024.103545
Spyros Angelopoulos , Christoph Dürr , Shendan Jin , Shahin Kamali , Marc Renault
{"title":"Online computation with untrusted advice","authors":"Spyros Angelopoulos ,&nbsp;Christoph Dürr ,&nbsp;Shendan Jin ,&nbsp;Shahin Kamali ,&nbsp;Marc Renault","doi":"10.1016/j.jcss.2024.103545","DOIUrl":"10.1016/j.jcss.2024.103545","url":null,"abstract":"<div><p>We study a generalization of the advice complexity model of online computation in which the advice is provided by an untrusted source. Our objective is to quantify the impact of untrusted advice so as to design and analyze online algorithms that are robust if the advice is adversarial, and efficient is the advice is foolproof. We focus on four well-studied online problems, namely ski rental, online bidding, bin packing and list update. For ski rental and online bidding, we show how to obtain algorithms that are Pareto-optimal with respect to the competitive ratios achieved, whereas for bin packing and list update, we give online algorithms with worst-case tradeoffs in their competitiveness, depending on whether the advice is trusted or adversarial. More importantly, we demonstrate how to prove lower bounds, within this model, on the tradeoff between the number of advice bits and the competitiveness of any online algorithm.</p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"144 ","pages":"Article 103545"},"PeriodicalIF":1.1,"publicationDate":"2024-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140800465","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
Decentralized deadlock-free enforcement of message orderings in message-based systems 基于消息的系统中消息排序的去中心化无死锁执行
IF 1.1 3区 计算机科学
Journal of Computer and System Sciences Pub Date : 2024-04-18 DOI: 10.1016/j.jcss.2024.103544
Mahboubeh Samadi, Fatemeh Ghassemi, Ramtin Khosravi
{"title":"Decentralized deadlock-free enforcement of message orderings in message-based systems","authors":"Mahboubeh Samadi,&nbsp;Fatemeh Ghassemi,&nbsp;Ramtin Khosravi","doi":"10.1016/j.jcss.2024.103544","DOIUrl":"https://doi.org/10.1016/j.jcss.2024.103544","url":null,"abstract":"<div><p>Message-based systems usually consist of distributed components that communicate using asynchronous message passing. In such systems, particular message orderings may violate some required properties. Given an automata-based specification of unwanted message sequences, we propose a decentralized deadlock-free runtime enforcement algorithm to prevent the formation of such sequences. In our approach, components are equipped with monitors executed concurrently. A component is only blocked before sending or receiving the last message of a sequence, until its associated monitor checks that such a message does not complete an unwanted sequence. According to the specification of unwanted sequences, some blocked components may suffer from a deadlock. Our deadlock-free algorithm guarantees that monitors detect and resolve such deadlocks by improving the existing deadlock detection algorithms. We evaluate the efficiency and scalability of our approach in terms of the communication overhead, the prevention latency, and the overhead of deadlock detection through simulation.</p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"144 ","pages":"Article 103544"},"PeriodicalIF":1.1,"publicationDate":"2024-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140645928","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
Labeled sample compression schemes for complexes of oriented matroids 定向矩阵复合体的标记样本压缩方案
IF 1.1 3区 计算机科学
Journal of Computer and System Sciences Pub Date : 2024-04-12 DOI: 10.1016/j.jcss.2024.103543
Victor Chepoi , Kolja Knauer , Manon Philibert
{"title":"Labeled sample compression schemes for complexes of oriented matroids","authors":"Victor Chepoi ,&nbsp;Kolja Knauer ,&nbsp;Manon Philibert","doi":"10.1016/j.jcss.2024.103543","DOIUrl":"https://doi.org/10.1016/j.jcss.2024.103543","url":null,"abstract":"<div><p>We show that the topes of a complex of oriented matroids (abbreviated COM) of VC-dimension <em>d</em> admit a proper labeled sample compression scheme of size <em>d</em>. This considerably extends results of Moran and Warmuth on ample classes, of Ben-David and Litman on affine arrangements of hyperplanes, and of the authors on complexes of uniform oriented matroids, and is a step towards the sample compression conjecture – one of the oldest open problems in computational learning theory. On the one hand, our approach exploits the rich combinatorial cell structure of COMs via oriented matroid theory. On the other hand, viewing tope graphs of COMs as partial cubes creates a fruitful link to metric graph theory.</p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"144 ","pages":"Article 103543"},"PeriodicalIF":1.1,"publicationDate":"2024-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140605005","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 the parameterized complexity of interval scheduling with eligible machine sets 论带合格机器集的区间调度的参数化复杂性
IF 1.1 3区 计算机科学
Journal of Computer and System Sciences Pub Date : 2024-03-29 DOI: 10.1016/j.jcss.2024.103533
Danny Hermelin , Yuval Itzhaki , Hendrik Molter , Dvir Shabtay
{"title":"On the parameterized complexity of interval scheduling with eligible machine sets","authors":"Danny Hermelin ,&nbsp;Yuval Itzhaki ,&nbsp;Hendrik Molter ,&nbsp;Dvir Shabtay","doi":"10.1016/j.jcss.2024.103533","DOIUrl":"10.1016/j.jcss.2024.103533","url":null,"abstract":"<div><p>We provide new parameterized complexity results for <span>Interval Scheduling on Eligible Machines</span>. In this problem, a set of <em>n</em> jobs is given to be processed non-preemptively on a set of <em>m</em> machines. Each job has a <em>processing time</em>, a <em>deadline</em>, a <em>weight</em>, and a set of <em>eligible machines</em> that can process it. The goal is to find a maximum weight subset of jobs that can each be processed on one of its eligible machines such that it completes exactly at its deadline. We focus on two parameters: The number <em>m</em> of machines, and the largest processing time <span><math><msub><mrow><mi>p</mi></mrow><mrow><mi>max</mi></mrow></msub></math></span>. Our main contribution is showing <span>W[1]</span>-hardness when parameterized by <em>m</em>. This answers Open Problem 8 of Mnich and van Bevern's list of 15 open problems in parameterized complexity of scheduling problems [Computers &amp; Operations Research, 2018]. Furthermore, we show <span>NP</span>-hardness even when <span><math><msub><mrow><mi>p</mi></mrow><mrow><mi>max</mi></mrow></msub><mo>=</mo><mi>O</mi><mo>(</mo><mn>1</mn><mo>)</mo></math></span> and present an <span>FPT</span>-algorithm with for the combined parameter <span><math><mi>m</mi><mo>+</mo><msub><mrow><mi>p</mi></mrow><mrow><mi>max</mi></mrow></msub></math></span>.</p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"144 ","pages":"Article 103533"},"PeriodicalIF":1.1,"publicationDate":"2024-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140402533","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信