All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F21%3A00354036" target="_blank" >RIV/68407700:21240/21:00354036 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1007/978-3-030-79987-8_31" target="_blank" >https://doi.org/10.1007/978-3-030-79987-8_31</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-030-79987-8_31" target="_blank" >10.1007/978-3-030-79987-8_31</a>

Alternative languages

  • 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 distance to disjoint paths with the desired eccentricity, and maximum leaf number.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

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

Others

  • Publication year

    2021

  • 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

  • Article name in the collection

    Combinatorial Algorithms

  • ISBN

    978-3-030-79986-1

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    14

  • Pages from-to

    442-455

  • Publisher name

    Springer International Publishing

  • Place of publication

    Cham

  • Event location

    virtuální / Ottawa, ON

  • Event date

    Jul 5, 2021

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000691567300031