| Download
All published worksheets from http://sagenb.org
Project: sagenb.org published worksheets
Views: 168774Image: ubuntu2004
Calculations for Claim 15:
Case w-a, x=3: negative (-29/570) when w=1 but ok for any smaller w
Case w-a, x=6: negative (-41/1110) when w=2 but ok for any smaller w
Case w-b, x=3: negative (-1/20) when w=1 but ok for any smaller w
Case w-b, x=6: negative (-3/190) when w=2 but ok for any smaller w
Case w-m, x=3: negative (-77/780) when w=1 but ok for any smaller w
Case w-m, x=6: negative (-7/165) when w=2 but ok for any smaller w
Case w-n, x=3: negative (-4/35) when w=1 but ok for any smaller w
Case w-n, x=6: negative (-9/230) when w=2 but ok for any smaller w
Case a-m, x=3: negative (-1/15) when w=1 but ok for any smaller w
Case b-m, x=3: negative (-13/420) when w=1 but ok for any smaller w
Calculations for Claim 18:
1/60 1/30 7/360 29/1320 1/10 7/60 7/360 139/1320 2/15 19/360 61/440 113/765 2809/16830 174/935
Calculations by Bellman-Ford algorithm, Theorem 26:
Distances stabilized, no negative cycles
Minimum s-t distance is 37/60