𝔖 Bobbio Scriptorium

✦ LIBER ✦

A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \log ^2 n)$

✍ Scribed by Spira, P. M.

Book ID: 118145721
Publisher: Society for Industrial and Applied Mathematics
Year: 1973
Tongue: English
Weight: 509 KB
Volume: 2
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0202004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new algorithm for finding the shortest

A new algorithm for finding the shortest path between a specified pair of nodes in a graph of nonnegative arcs

✍ S. Jeyaratnam 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 276 KB

An O(n2) algorithm for the satisfiabilit

An O(n2) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all horn sentences

✍ V. Arvind; S. Biswas 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 217 KB

[ACM Press the second annual symposium -

[ACM Press the second annual symposium - Yorktown Heights, New York, United States (1986.06.02-1986.06.04)] Proceedings of the second annual symposium on Computational geometry - SCG '86 - A simple divide-and-conquer algorithm for computing Delaunay triangulations in O(n log log n) expected time

✍ Dwyer, R A 📂 Article 📅 1986 🏛 ACM Press ⚖ 747 KB