arXiv (All)
open access
Efficient Dynamic Algorithms for Graph Neural Networks with Non-Linear Propagation
Graph Neural Networks (GNNs) are widely used for representation learning on graphs, but most methods assume static topologies, making them inefficient on evolving networks where edges change over time. Existing dynamic approaches either model graph evolution through temporal GNN architectures withou
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Beyond Fixed Features: Architecture-Dependent Sensitivity to Node Representations under Heterophily#1118837
- Edge Sparsification via Temporal Forman-Ricci Curvature for Dynamic Graph Learning#440388
- Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set#1135853
- NeuronSoup: Evolving Asynchronous, Shared-Neuron Temporal Graphs without Backpropagation#373374
- Combinatorial optimization with physics-inspired graph neural networks#19723
Record · ID 1117641
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive