Minimum eccentricity shortest path problem with respect to structural parameters

DOI10.1007/978-3-030-79987-8_31OpenAlexW3185927671MaRDI QIDQ5918625

Ondřej Suchý, Martin Kučera

Publication date: 22 March 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.07898

zbMATH Keywords

graph theoryparameterized complexityfixed-parameter tractableminimum eccentricity shortest path

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

Parameterized algorithms for eccentricity shortest path problem

Cites Work

• A fast branching algorithm for cluster vertex deletion
• Decomposing a graph into shortest paths with bounded eccentricity
• On the minimum eccentricity shortest path problem
• 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
• On the Minimum Eccentricity Shortest Path Problem
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• Parameterized Algorithms
• Unnamed Item

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