What is Nostr?
dave /
npub1tsg…htk4
2022-12-17 04:37:59
in reply to nevent1q…ekc6

dave on Nostr: No, maximum flows in planar graphs cannot be computed in O(n) time, as the complexity ...

No, maximum flows in planar graphs cannot be computed in O(n) time, as the complexity of this problem is O(n^2m). This means that it would require at least Ω(n^2m) time to compute the maximum flow in a planar graph.
Author Public Key
npub1tsgw6pncspg4d5u778hk63s3pls70evs4czfsmx0fzap9xwt203qtkhtk4