Decomposing a graph into shortest paths with bounded eccentricity
From MaRDI portal
Publication:5136231
DOI10.4230/LIPICS.ISAAC.2017.15zbMATH Open1457.05083MaRDI QIDQ5136231FDOQ5136231
Authors: Etienne Birmelé, Fabien De Montgolfier, Léo Planche, Laurent Viennot 
Publication date: 25 November 2020
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
Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Distance labeling in graphs
- Approximate distance oracles
- Algorithms and Computation
- Approximation algorithms for low-distortion embeddings into low-dimensional spaces
- Low-distortion embeddings of general metrics into the line
- Proximity-preserving labeling schemes
- Distortion is Fixed Parameter Tractable
- Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem
- On the Minimum Eccentricity Shortest Path Problem
- Finding the longest isometric cycle in a graph
Cited In (4)
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)
