Minimum eccentricity shortest paths in some structured graph classes
From MaRDI portal
Publication:2807326
DOI10.7155/JGAA.00394zbMATH Open1338.05262OpenAlexW2548661577MaRDI QIDQ2807326FDOQ2807326
Authors: Feodor F. Dragan, Arne Leitert 
Publication date: 20 May 2016
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00394
Recommendations
- Minimum eccentricity shortest paths in some structured graph classes
- Minimum eccentricity shortest path problem with respect to structural parameters
- On the minimum eccentricity shortest path problem
- On the minimum eccentricity shortest path problem
- Minimum eccentricity shortest path problem: an approximation algorithm and relation with the \(k\)-laminarity problem
Cited In (10)
- On the minimum eccentricity shortest path problem
- Path eccentricity of graphs
- On the minimum eccentricity shortest path problem
- Decomposing a graph into shortest paths with bounded eccentricity
- Minimum eccentricity shortest paths in some structured graph classes
- Minimum eccentricity shortest path problem: an approximation algorithm and relation with the \(k\)-laminarity problem
- Minimum eccentricity shortest path problem with respect to structural parameters
- Minimum eccentricity shortest path problem with respect to structural parameters
- Decomposing a graph into shortest paths with bounded eccentricity
- Pathlength of outerplanar graphs
This page was built for publication: Minimum eccentricity shortest paths in some structured graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807326)
