scientific article; zbMATH DE number 1875406
From MaRDI portal
Publication:4796165
zbMath1006.68543MaRDI QIDQ4796165
Publication date: 2 March 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2161/21610033
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (32)
A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs ⋮ A new approach to all-pairs shortest paths on real-weighted graphs ⋮ A survey of the all-pairs shortest paths problem and its variants in graphs ⋮ Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models ⋮ Labeled shortest paths in digraphs with negative and positive edge weights ⋮ QUBO formulations of the longest path problem ⋮ On computing the diameter of real-world undirected graphs ⋮ A novel pseudo‐polynomial approach for shortest path problems ⋮ An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs ⋮ Approximate shortest paths in weighted graphs ⋮ Some results on approximate 1-median selection in metric spaces ⋮ Shortest distances as enumeration problem ⋮ Approximating average parameters of graphs ⋮ All-pairs bottleneck paths in vertex weighted graphs ⋮ Unnamed Item ⋮ Finding the first \(K\) shortest paths in a time-window network. ⋮ Compact navigation and distance oracles for graphs with small treewidth ⋮ Compact roundtrip routing with topology-independent node names ⋮ Discovery of network properties with all-shortest-paths queries ⋮ Shortest-path queries in static networks ⋮ Algebraic methods in the congested clique ⋮ Approximate shortest paths guided by a small index ⋮ Efficient approximation algorithms for shortest cycles in undirected graphs ⋮ Solving path problems on the GPU ⋮ Approximating Shortest Paths in Graphs ⋮ Ramsey partitions and proximity data structures ⋮ All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time ⋮ Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs ⋮ Many distances in planar graphs ⋮ Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation ⋮ Vertex labeling and routing for Farey-type symmetrically-structured graphs ⋮ Low-Distortion Inference of Latent Similarities from a Multiplex Social Network
This page was built for publication:
