Decomposing a graph into shortest paths with bounded eccentricity
From MaRDI portal
(Redirected from Publication:5136231)
Decomposing a graph into shortest paths with bounded eccentricity (scientific article; zbMATH DE number 7278020)
Decomposing a graph into shortest paths with bounded eccentricity (scientific article; zbMATH DE number 7278020)
Recommendations
- Decomposing a graph into shortest paths with bounded eccentricity
- Minimum eccentricity shortest path problem: an approximation algorithm and relation with the k-laminarity problem
- On the minimum eccentricity shortest path problem
- On the minimum eccentricity shortest path problem
- Minimum eccentricity shortest paths in some structured graph classes
Cites work
- scientific article; zbMATH DE number 3636876 (Why is no real title available?)
- Algorithms and Computation
- Approximate distance oracles
- Approximation algorithms for low-distortion embeddings into low-dimensional spaces
- Distance labeling in graphs
- Distortion is fixed parameter tractable
- Finding the longest isometric cycle in a graph
- Low-distortion embeddings of general metrics into the line
- Minimum eccentricity shortest path problem: an approximation algorithm and relation with the k-laminarity problem
- On the minimum eccentricity shortest path problem
- Proximity-preserving labeling schemes
Cited in
(5)- Minimum eccentricity shortest path problem with respect to structural parameters
- Minimum eccentricity shortest path problem with respect to structural parameters
- On the minimum eccentricity isometric cycle problem
- On the minimum eccentricity shortest path problem
- Decomposing a graph into shortest paths with bounded eccentricity
This page was built for publication: Decomposing a graph into shortest paths with bounded eccentricity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136231)
