scientific article; zbMATH DE number 2086613
From MaRDI portal
Publication:4737147
zbMATH Open1056.68111MaRDI QIDQ4737147FDOQ4737147
Authors: Seth Pettie 
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2380/23800085.htm
Title of this publication is not available (Why is that?)
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (16)
- Title not available (Why is that?)
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- A Shortest Path Algorithm for Real-Weighted Undirected Graphs
- A note of an \(O(n^{3}/\log n)\) time algorithm for all pairs shortest paths
- Improved algorithm for all pairs shortest paths
- Title not available (Why is that?)
- Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
- Solving all-pairs shortest path by single-source computations: theory and practice
- A new approach to all-pairs shortest paths on real-weighted graphs
- All-pairs shortest paths algorithm for high-dimensional sparse graphs
- An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths
- More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
- 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
- Computing all-pairs shortest paths by leveraging low treewidth
- Speeding up shortest path algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737147)
