Length-bounded cuts: Proper interval graphs and structural parameters
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F22%3A00357390" target="_blank" >RIV/68407700:21240/22:00357390 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1016/j.jcss.2021.12.002" target="_blank" >https://doi.org/10.1016/j.jcss.2021.12.002</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jcss.2021.12.002" target="_blank" >10.1016/j.jcss.2021.12.002</a>
Alternative languages
Result language
angličtina
Original language name
Length-bounded cuts: Proper interval graphs and structural parameters
Original language description
We study the LENGTH-BOUNDED CUT problem for special graph classes and from a parameterized complexity viewpoint. Here, we are given a graph G, two vertices s and t, and positive integers β and λ. The task is to find a set F of at most β edges such that each s-t-path of length at most λ in G contains some edge in F. Bazgan et al. [20] conjectured that LENGTH-BOUNDED CUT admits a polynomial-time algorithm if the input graph is a proper interval graph. We confirm this conjecture by providing a dynamic-programming-based polynomial-time algorithm. Moreover, we strengthen the W[1]-hardness result of Dvořák and Knop for LENGTH-BOUNDED CUT parameterized by pathwidth by showing W[1]-hardness for the combined parameter pathwidth and maximum degree of the input graph. Finally, we prove that LENGTH-BOUNDED CUT is W[1]-hard for the feedback vertex number. Both our hardness results complement known XP algorithms.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/EF16_019%2F0000765" target="_blank" >EF16_019/0000765: Research Center for Informatics</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Computer and System Sciences
ISSN
0022-0000
e-ISSN
1090-2724
Volume of the periodical
126
Issue of the periodical within the volume
June
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
23
Pages from-to
21-43
UT code for WoS article
000793819400001
EID of the result in the Scopus database
2-s2.0-85122311438