Minimum eccentricity shortest path problem with respect to structural parameters

DOI10.1007/s00453-022-01006-xOpenAlexW4287687986WikidataQ114229324 ScholiaQ114229324MaRDI QIDQ5925631

Martin Kučera, Ondřej Suchý

Publication date: 9 March 2023

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-022-01006-x

zbMATH Keywords

graph theoryparameterized complexityfixed-parameter tractableminimum eccentricity shortest path

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Unnamed Item
• A fast branching algorithm for cluster vertex deletion
• Decomposing a graph into shortest paths with bounded eccentricity
• On the minimum eccentricity shortest path problem
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Minimum Eccentricity Shortest Paths in some Structured Graph Classes
• Parameterized Algorithms for Modular-Width
• Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem
• Easy problems for tree-decomposable graphs
• On the Minimum Eccentricity Shortest Path Problem
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• Parameterized Algorithms

This page was built for publication: Minimum eccentricity shortest path problem with respect to structural parameters