Abstract
The best algorithm for finding the shortest paths between every pair of vertices in a complete graph is the triple algorithm. This algorithm can be described algebraically as an operation of a category on the set of real valued finite directed graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete
Paper Title
Journal
Date
