Training One-Dimensional Graph Neural Networks is NP-Hard

Abstract

Full Citation:

Robert Ganian, Mathis Rocton, Simon Wietheger. Training One-Dimensional Graph Neural Networks is NP-Hard. The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net.

Robert Ganian

Robert Ganian is a Professor at the Algorithms and Complexity Group.

Mathis Teva Rocton

Mathis Teva Rocton is a Project Assistant at the Algorithms and Complexity Group.

Simon Wietheger

Simon Wietheger is a Project Assistant at the Algorithms and Complexity Group.