Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca
{"title":"On Graphs Coverable by [math] Shortest Paths","authors":"Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca","doi":"10.1137/23m1564511","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1840-1862, June 2024. <br/> Abstract. We show that if the edges or vertices of an undirected graph [math] can be covered by [math] shortest paths, then the pathwidth of [math] is upper-bounded by a single-exponential function of [math]. As a corollary, we prove that the problem Isometric Path Cover with Terminals (which, given a graph [math] and a set of [math] pairs of vertices called terminals, asks whether [math] can be covered by [math] shortest paths, each joining a pair of terminals) is FPT with respect to the number of terminals. The same holds for the similar problem Strong Geodetic Set with Terminals (which, given a graph [math] and a set of [math] terminals, asks whether there exist [math] shortest paths covering [math], each joining a distinct pair of terminals). Moreover, this implies that the related problems Isometric Path Cover and Strong Geodetic Set (defined similarly but where the set of terminals is not part of the input) are in XP with respect to parameter [math].","PeriodicalId":49530,"journal":{"name":"SIAM Journal on Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2024-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/23m1564511","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
SIAM Journal on Discrete Mathematics, Volume 38, Issue 2, Page 1840-1862, June 2024. Abstract. We show that if the edges or vertices of an undirected graph [math] can be covered by [math] shortest paths, then the pathwidth of [math] is upper-bounded by a single-exponential function of [math]. As a corollary, we prove that the problem Isometric Path Cover with Terminals (which, given a graph [math] and a set of [math] pairs of vertices called terminals, asks whether [math] can be covered by [math] shortest paths, each joining a pair of terminals) is FPT with respect to the number of terminals. The same holds for the similar problem Strong Geodetic Set with Terminals (which, given a graph [math] and a set of [math] terminals, asks whether there exist [math] shortest paths covering [math], each joining a distinct pair of terminals). Moreover, this implies that the related problems Isometric Path Cover and Strong Geodetic Set (defined similarly but where the set of terminals is not part of the input) are in XP with respect to parameter [math].
期刊介绍：
SIAM Journal on Discrete Mathematics (SIDMA) publishes research papers of exceptional quality in pure and applied discrete mathematics, broadly interpreted. The journal''s focus is primarily theoretical rather than empirical, but the editors welcome papers that evolve from or have potential application to real-world problems. Submissions must be clearly written and make a significant contribution.
Topics include but are not limited to:
properties of and extremal problems for discrete structures
combinatorial optimization, including approximation algorithms
algebraic and enumerative combinatorics
coding and information theory
additive, analytic combinatorics and number theory
combinatorial matrix theory and spectral graph theory
design and analysis of algorithms for discrete structures
discrete problems in computational complexity
discrete and computational geometry
discrete methods in computational biology, and bioinformatics
probabilistic methods and randomized algorithms.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
