scientific article; zbMATH DE number 2086613
From MaRDI portal
Publication:4737147
zbMath1056.68111MaRDI QIDQ4737147
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2380/23800085.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
A note of an \(O(n^{3}/\log n)\) time algorithm for all pairs shortest paths ⋮ Improved algorithm for all pairs shortest paths ⋮ An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths ⋮ Path Laplacian matrices: introduction and application to the analysis of consensus in networks ⋮ An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path ⋮ Discrete sensor placement problems in distribution networks ⋮ Unnamed Item
