Dual-GNN multilevel coarsening for maximum independent set
Read the original at arxiv.org→arXiv:2609.25149v1 Announce Type: new Abstract: Solving large-scale instances of the Traveling Salesman Problem (TSP) exactly is computationally expensive. Researchers often employ graph sparsification methods to...
Original headline: "Dual-GNN Multilevel Coarsening for Maximum Independent Set"
Coverage timeline
- Sep 23, 04:00 UTC arXiv cs.LG lead source Dual-GNN Multilevel Coarsening for Maximum Independent Set