Cover Image

Covered Forest: Fine-grained generalization analysis of graph neural networks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Vasileiou, Antonis, Finkelshtein, Ben, Geerts, Floris, Levie, Ron, Morris, Christopher
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Discrete Mathematics Data Structures and Algorithms Neural and Evolutionary Computing
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Weisfeiler-Leman at the margin: When more expressivity matters
by: Franks, Billy J., et al.
Published: (2024)

Which Algorithms Can Graph Neural Networks Learn?
by: Wittig, Solveig, et al.
Published: (2026)

Local search for valued constraint satisfaction parameterized by treedepth
by: Kaznatcheev, Artem
Published: (2024)

Future Directions in the Theory of Graph Machine Learning
by: Morris, Christopher, et al.
Published: (2024)

A Denoising Diffusion-Based Evolutionary Algorithm Framework: Application to the Maximum Independent Set Problem
by: Soler, Joan Salvà, et al.
Published: (2025)

A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem
by: Zou, Yuji, et al.
Published: (2024)

Triangle Detection in H-Free Graphs
by: Abboud, Amir, et al.
Published: (2025)

On the Bidirected Cut Relaxation for Steiner Forest
by: Byrka, Jarosław, et al.
Published: (2024)

Learning to Approximate Uniform Facility Location via Graph Neural Networks
by: Qian, Chendi, et al.
Published: (2026)

Circular-arc graphs and the Helly property
by: Derbisz, Jan, et al.
Published: (2024)

The Complexity of Diameter on H-free graphs
by: Oostveen, Jelle J., et al.
Published: (2024)

Minimum Sum Set Cover: Structures and Algorithm
by: Zhang, Zhongyi, et al.
Published: (2026)

Edge Clique Partition and Cover Beyond Independence
by: Fomin, Fedor V., et al.
Published: (2025)

Continuous optimization methods for the graph isomorphism problem
by: Klus, Stefan, et al.
Published: (2023)

Circle graphs can be recognized in linear time
by: Paul, Christophe, et al.
Published: (2025)

Packing $K_r$s in bounded degree graphs
by: McKay, Michael, et al.
Published: (2022)

Generalizing Roberts' characterization of unit interval graphs
by: Martínez, Virginia Ardévol, et al.
Published: (2024)

Reconfiguration of labeled matchings in triangular grid graphs
by: Kakimura, Naonori, et al.
Published: (2024)

Independent set reconfiguration in H-free graphs
by: Bartier, Valentin, et al.
Published: (2024)

The Complexity of Temporal Vertex Cover in Small-Degree Graphs
by: Hamm, Thekla, et al.
Published: (2022)

Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective
by: Fomin, Fedor V., et al.
Published: (2024)

On zeros and algorithms for disordered systems: mean-field spin glasses
by: Bencs, Ferenc, et al.
Published: (2025)

Generation of weighted trees, block trees and block graphs
by: Ekim, Tınaz, et al.
Published: (2024)

Max Weight Independent Set in sparse graphs with no long claws
by: Abrishami, Tara, et al.
Published: (2023)

A polynomial kernel for vertex deletion into bipartite permutation graphs
by: Derbisz, Jan
Published: (2021)

All ascents exponential from valued constraint graphs of pathwidth three
by: Kaznatcheev, Artem, et al.
Published: (2026)

Feedback Vertex Set for pseudo-disk graphs in subexponential FPT time
by: Berthe, Gaétan, et al.
Published: (2024)

Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
by: Komusiewicz, Christian, et al.
Published: (2026)

Fast approximation algorithms for the 1-median problem on real-world large graphs
by: Ueta, Keisuke, et al.
Published: (2025)

A column generation algorithm for finding co-3-plexes in chordal graphs
by: Dupont-Bouillard, Alexandre
Published: (2026)

Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
by: German, Samuel
Published: (2026)

Using random spanning trees in survivable networks design
by: Wrobel, Blazej, et al.
Published: (2025)

Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth
by: Foucaud, Florent, et al.
Published: (2025)

Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time
by: Liu, Bowie, et al.
Published: (2025)

Sampling Balanced Forests of Grids in Polynomial Time
by: Cannon, Sarah, et al.
Published: (2023)

Optimal Enumeration of Eulerian Trails in Directed Graphs
by: Bals, Ben, et al.
Published: (2026)

Distribution Testing in the Presence of Arbitrarily Dominant Noise with Verification Queries
by: Black, Hadley, et al.
Published: (2025)

Testing Quasiperiodicity
by: Awofeso, Christine, et al.
Published: (2025)

Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
by: Bencs, Ferenc, et al.
Published: (2025)

Non-Spatial Hash Chemistry as a Minimalistic Open-Ended Evolutionary System
by: Sayama, Hiroki
Published: (2024)