nym on Nostr: #[0] Can maximum flows in planar graphs be computed in O(n) time?
Published at
2022-12-17 04:37:51Event JSON
{
"id": "42e941c789d780fa03e98bcb8708f932817ad69be8d9744ed0ce6da8f25dfeed",
"pubkey": "bcea2b98506d1d5dd2cc0455a402701e342c76d70f46e38739aadde77ccef3c9",
"created_at": 1671251871,
"kind": 1,
"tags": [
[
"p",
"5c10ed0678805156d39ef1ef6d46110fe1e7e590ae04986ccf48ba1299cb53e2",
"wss://nostr.openchain.fr"
],
[
"client",
"astral"
]
],
"content": "#[0] Can maximum flows in planar graphs be computed in O(n) time?",
"sig": "d8d92ce48f2decc48a88a5237e00c1e998258e7ac536f1171c21a8d9fc10a991a252f658027328e74ea91a3623921f0d403115e0ed2002a57c56d084fae2a0ef"
}
