Timeline for Termination of the Bellman-Ford algorithm in asynchronous distributed model
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 26, 2013 at 14:17 | comment | added | pkacprzak | @VolkerTurau yes | |
| Sep 26, 2013 at 13:46 | comment | added | Volker Turau | A proof that the algorithm terminates in time O(Diam(G)) is contained in Peleg's book (p. 53). Do you want the root to detect the termination in this time? | |
| Sep 25, 2013 at 14:24 | vote | accept | pkacprzak | ||
| Sep 25, 2013 at 14:25 | |||||
| Sep 25, 2013 at 14:24 | answer | added | pkacprzak | timeline score: 1 | |
| Aug 23, 2013 at 15:14 | history | tweeted | twitter.com/#!/StackCSTheory/status/370926917220065280 | ||
| Aug 21, 2013 at 21:37 | review | First posts | |||
| Aug 24, 2013 at 3:34 | |||||
| Aug 21, 2013 at 21:31 | history | edited | pkacprzak | CC BY-SA 3.0 |
deleted 2 characters in body; edited title
|
| Aug 21, 2013 at 21:22 | history | asked | pkacprzak | CC BY-SA 3.0 |