scientific article; zbMATH DE number 7278020
From MaRDI portal
Publication:5136231
DOI10.4230/LIPIcs.ISAAC.2017.15zbMath1457.05083MaRDI QIDQ5136231
Etienne Birmelé, Laurent Viennot, Fabien de Montgolfier, Léo Planche
Publication date: 25 November 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Related Items (3)
On the minimum eccentricity isometric cycle problem ⋮ Minimum eccentricity shortest path problem with respect to structural parameters ⋮ Minimum eccentricity shortest path problem with respect to structural parameters
Cites Work
- Finding the longest isometric cycle in a graph
- 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
- Approximate distance oracles
- Low-distortion embeddings of general metrics into the line
- Distance labeling in graphs
- Proximity-preserving labeling schemes
- Algorithms and Computation
- Unnamed Item
- Unnamed Item
This page was built for publication:
