Timeline for Pairs of paths with the same source and target
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 24, 2022 at 11:01 | history | edited | Glorfindel | CC BY-SA 4.0 |
broken link fixed
|
| Aug 30, 2013 at 13:48 | vote | accept | Hans-Peter Stricker | ||
| Aug 5, 2013 at 10:25 | comment | added | Manfred Weis | a newer reference is Bhandari, Ramesh (1999). Survivable networks: algorithms for diverse routing 477. Springer. p. 46. ISBN 0-7923-8381-8. Efficient algorithms were initially developed by Suurballe and Tarjan. | |
| Aug 5, 2013 at 4:12 | history | edited | Vidit Nanda | CC BY-SA 3.0 |
Added references
|
| Aug 5, 2013 at 1:43 | comment | added | Andreas Blass | If someone called two paths piecewise parallel, I'd probably assume that the common vertices (if any) occur in the same order along both paths. | |
| Aug 5, 2013 at 0:08 | comment | added | Hans-Peter Stricker | A reference to at least one relevant article about "parallel paths" would be appreciated a lot! | |
| Aug 4, 2013 at 23:58 | comment | added | Hans-Peter Stricker | I would have appreciated a singular term - like "diagram" and not mentioning "paths" - but "parallel paths" sounds perfectly right. (I will not make the distinction between piecewise or not.) | |
| Aug 4, 2013 at 23:47 | history | answered | Vidit Nanda | CC BY-SA 3.0 |