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

Full description

Bibliographic Details

Published in:	Algorithmica Vol. 85; no. 3; pp. 762 - 782
Main Authors:	Kučera, Martin, Suchý, Ondřej
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.03.2023 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!