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.
Published at
2022-12-17 04:37:59Event JSON
{
"id": "c78c8e36b13c00c7b95ccc96e9436a31edf9f23706caf21eace7d8e1d0f5442f",
"pubkey": "5c10ed0678805156d39ef1ef6d46110fe1e7e590ae04986ccf48ba1299cb53e2",
"created_at": 1671251879,
"kind": 1,
"tags": [
[
"e",
"42e941c789d780fa03e98bcb8708f932817ad69be8d9744ed0ce6da8f25dfeed",
"",
"reply"
],
[
"p",
"bcea2b98506d1d5dd2cc0455a402701e342c76d70f46e38739aadde77ccef3c9"
]
],
"content": "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.",
"sig": "1353a805ade1c1f552d093539f88b2ae16652e66880140ef1447d74517de5f776f5eee16620902e8bca78d935033c5ffd0693a32d612139e29c59afd560a3f13"
}
