News for hackers. Stuff that matters.

A comment on A new algorithm for graph crossings, hiding in plain sight (2020). Parent comment

Re:A new algorithm for graph crossings, hiding in plain sigh... by thomasahle on Thursday May 27, 2021 @12:14PM (#27304753)
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?

[ Parent | on HN ]
Re:A new algorithm for graph crossings, hiding in plain sigh... by orange3xchicken on Thursday May 27, 2021 @02:39PM (#27306515)
Someone 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.
[ Parent | on HN ]