Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F23%3A00365734" target="_blank" >RIV/68407700:21240/23:00365734 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/s00453-022-01006-x" target="_blank" >https://doi.org/10.1007/s00453-022-01006-x</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00453-022-01006-x" target="_blank" >10.1007/s00453-022-01006-x</a>

Result language
angličtina
Original language name
Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters
Original language description
The Minimum Eccentricity Shortest Path Problem consists in finding a shortest path with minimum eccentricity in a given undirected graph. The problem is known to be NP-complete and W[2]-hard with respect to the desired eccentricity. We present fpt-algorithms for the problem parameterized by the modular width, distance to cluster graph, the combination of treewidth with the desired eccentricity, and maximum leaf number.
Czech name
—
Czech description
—

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)

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)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2023
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)