Training One-Dimensional Graph Neural Networks is NP-Hard
R. Ganian, Mathis Rocton, Simon Wietheger
2/12/2026
No confident code implementation found for this paper. 2 possible matches can be shown below.
No confident code implementation found for this paper. 2 possible matches can be shown below.
No confident code match yet
We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.
No code implementations found yet.
Know of an implementation? Let us know in the comments below!
@article{ganian2026training,
title = {Training One-Dimensional Graph Neural Networks is NP-Hard},
author = {R. Ganian and Mathis Rocton and Simon Wietheger},
year = {2026},
url = {https://api.semanticscholar.org/CorpusID:b0b9f160e010a7ee727f8fa731c76816358b1f0b},
journal = {ICLR 2025 2025}
}