On the Complexity of Optimal Graph Rewiring for Oversmoothing and Oversquashing in Graph Neural Networks

This research establishes the NP-hard complexity of optimizing graph topology to resolve oversmoothing and oversquashing in deep Graph Neural Networks, provi...

Level: expert

By Mostafa Haghir Chehreghani

Category: research