3 ms·
That sounds like a nice problem: Partition the vertices into planar sub-graphs, minimizing the number of edges between parts. It's not really a dynamic problem
by thomasahle 5y ago
That sounds like a nice problem: Partition the vertices into planar sub-graphs, minimizing the number of edges between parts.
It's not really a dynamic problem anymore. It also becomes very specific to ASIC. Do you know if it has already been studied?
- orange3xchicken 5y agoSomeone correct me, but I think hMetis is one popular software/algorithm for multi-level graph/hypergraph partitioning. There is also KaHyPar which is a bit more academic.