An all pairs shortest algorithm taking 0 (n2 logn/loglogn) time on the average [C.T.I. Technical Report] TR 91.01.2
Main Authors: | , |
---|---|
Format: | Book |
Language: | English |
Published: |
[Patras Greece] Patras Greece New York Πάτρα Ελλάδα
Computer Technology Institute Computer Science and Engineering Department, Patras University Courant Institute of Mathematical Sciences, U.S.A. Ινστιτούτο Τεχνολογίας Υπολογιστών
1991
|
Subjects: |
Μηχανικών Η/Υ και Πληροφορικής: Unknown
Call Number: |
Unknown |
---|---|
Copy 1 | Available |