scientific article; zbMATH DE number 2119743

zbMath1093.68622MaRDI QIDQ4829018

Philip N. Klein

Publication date: 29 November 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (15)

Covering metric spaces by few trees ⋮ Prioritized Metric Structures and Embedding ⋮ Labelings vs. embeddings: on distributed and prioritized representations of distances ⋮ A parallel bio-inspired shortest path algorithm ⋮ Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs ⋮ Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. ⋮ Efficient vertex-label distance oracles for planar graphs ⋮ Faster approximate diameter and distance oracles in planar graphs ⋮ Shortest-path queries in static networks ⋮ Efficient dynamic approximate distance oracles for vertex-labeled planar graphs ⋮ Unnamed Item ⋮ Single-source shortest paths and strong connectivity in dynamic planar graphs ⋮ Covering Metric Spaces by Few Trees ⋮ Faster Approximate Diameter and Distance Oracles in Planar Graphs ⋮ Unnamed Item

This page was built for publication: