Algorithms – ESA 2004
From MaRDI portal
Publication:5464616
DOI10.1007/b100428zbMath1111.68599OpenAlexW2483610301MaRDI QIDQ5464616
Publication date: 18 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100428
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (20)
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture ⋮ Distance oracles for time-dependent networks ⋮ Small Stretch Pairwise Spanners and Approximate $D$-Preservers ⋮ A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs ⋮ Dynamic Single-Source Shortest Paths in Erdös-Rényi Random Graphs ⋮ On Dynamic DFS Tree in Directed Graphs ⋮ New pairwise spanners ⋮ Unnamed Item ⋮ Average update times for fully-dynamic all-pairs shortest paths ⋮ Average-Case Analysis of Online Topological Ordering ⋮ On the complexity of time-dependent shortest paths ⋮ Incremental single-source shortest paths in digraphs with arbitrary positive arc weights ⋮ Average-case analysis of incremental topological ordering ⋮ Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs ⋮ Unnamed Item ⋮ Distributed algorithms for ultrasparse spanners and linear size skeletons ⋮ Light Spanners ⋮ Light spanners for high dimensional norms via stochastic decompositions ⋮ Elastic-Degenerate String Matching via Fast Matrix Multiplication ⋮ Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time
This page was built for publication: Algorithms – ESA 2004
