JI on Nostr: Graph theory question: let G=(V, E) be a planar, acyclic graph with no leaf vertices, ...
Graph theory question: let G=(V, E) be a planar, acyclic graph with no leaf vertices, where the size of the graph multiple of a small integer n (|E| = kn). Partition it into k unique subgraphs G_i=(V_i, E_i), 1≤i≤k, so that |E_i|=n for all i. For example, this graph has |E|=6, n=2, k=3.
Published at
2024-02-06 00:24:29Event JSON
{
"id": "dfd324d4b5c9c55695bbceca825acd8aff10392685dc0f8b5e5e8d0058065758",
"pubkey": "f18d6a62adbd6e3f7d1dc0ca7c482563926507054e7aaa58f457c11b92d0ac30",
"created_at": 1707179069,
"kind": 1,
"tags": [
[
"proxy",
"https://infosec.exchange/users/marabou/statuses/111881687475632944",
"activitypub"
]
],
"content": "Graph theory question: let G=(V, E) be a planar, acyclic graph with no leaf vertices, where the size of the graph multiple of a small integer n (|E| = kn). Partition it into k unique subgraphs G_i=(V_i, E_i), 1≤i≤k, so that |E_i|=n for all i. For example, this graph has |E|=6, n=2, k=3.",
"sig": "7fa61af9ecf63c56c54f62b85193b644f5812b8eb80644cb9d2c5c24e055069c7054b7bdc8326695abbd896234354b7097b780f6c54b147b31831e7a69ea8338"
}
