Algorithms and Data Structures
From MaRDI portal
Publication:5394260
DOI10.1007/11534273zbMath1151.68564OpenAlexW3010016474MaRDI QIDQ5394260
Publication date: 25 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11534273
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
Speeding up HMM decoding and training by exploiting sequence repetitions ⋮ A note of an \(O(n^{3}/\log n)\) time algorithm for all pairs shortest paths ⋮ An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths ⋮ Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs ⋮ A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem ⋮ An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path
This page was built for publication: Algorithms and Data Structures
