Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters

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 modu...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Algorithmica Ročník 85; číslo 3; s. 762 - 782
Hlavní autoři: Kučera, Martin, Suchý, Ondřej
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.03.2023
Springer Nature B.V
Témata:
Algorithm Analysis and Problem Complexity
Algorithms
Computer Science
Computer Systems Organization and Communication Networks
Data Structures and Information Theory
Eccentricity
Mathematics of Computing
Shortest-path problems
Special Issue on Combinatorial Algorithms (IWOCA 2021)
Theory of Computation
Minimum eccentricity shortest path
Graph theory
Fixed-parameter tractable
Parameterized complexity
ISSN:0178-4617, 1432-0541
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0178-4617
1432-0541
DOI:10.1007/s00453-022-01006-x