Minimum Eccentricity Shortest Paths in Some Structured Graph Classes
From MaRDI portal
Publication:2827811
DOI10.1007/978-3-662-53174-7_14zbMath1417.05205arXiv1511.05109OpenAlexW2269057841MaRDI QIDQ2827811
Arne Leitert, Feodor F. Dragan
Publication date: 21 October 2016
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.05109
Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
On the Minimum Eccentricity Shortest Path Problem ⋮ Parameterized algorithms for eccentricity shortest path problem
Cites Work
- Distance-hereditary graphs
- HAMILTONian circuits in chordal bipartite graphs
- LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
- Line-Distortion, Bandwidth and Path-Length of a Graph
- On the Minimum Eccentricity Shortest Path Problem
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Convexity in Graphs and Hypergraphs
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- Planar Formulae and Their Uses
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Graph Classes: A Survey
- Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
This page was built for publication: Minimum Eccentricity Shortest Paths in Some Structured Graph Classes