Parameterized Complexity of Length-bounded Cuts and Multicuts
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10387002" target="_blank" >RIV/00216208:11320/18:10387002 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/s00453-018-0408-7" target="_blank" >https://doi.org/10.1007/s00453-018-0408-7</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00453-018-0408-7" target="_blank" >10.1007/s00453-018-0408-7</a>
Alternative languages
Result language
angličtina
Original language name
Parameterized Complexity of Length-bounded Cuts and Multicuts
Original language description
We study the Minimum Length-Bounded Cut problem where the task is to find a set of edges of a graph such that after removal of this set, the shortest path between two prescribed vertices is at least L+1 long. We show the problem can be computed in
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
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2018
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
Algorithmica [online]
ISSN
1432-0541
e-ISSN
—
Volume of the periodical
2018
Issue of the periodical within the volume
80
Country of publishing house
GB - UNITED KINGDOM
Number of pages
21
Pages from-to
3597-3617
UT code for WoS article
000447361100006
EID of the result in the Scopus database
2-s2.0-85040778875