You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Im reading you paper and i think than in page 3, Algorithm 1: The lock-free push-relabel algorithm,
AT LINE 12 the code if h' < h(v) then
Should be: if h(v) < h' then
This because h' is initialized to be infinite so it cant be never smaller then some other value.
Let me know if im wrong or you already addressed this issue.
Thank you ;)
The text was updated successfully, but these errors were encountered:
Thank you for taking the time to review our paper and for highlighting the mistake. We appreciate your keen attention to detail. You are right, and we will quickly address this issue and re-publish the revised version of the paper.
Hi, im Giovanni Rasera
Im reading you paper and i think than in page 3, Algorithm 1: The lock-free push-relabel algorithm,
AT LINE 12 the code
if h' < h(v) then
Should be:
if h(v) < h' then
This because h' is initialized to be infinite so it cant be never smaller then some other value.
Let me know if im wrong or you already addressed this issue.
Thank you ;)
The text was updated successfully, but these errors were encountered: