Concept
Morphisme de graphes
Publications associées (74)
The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al.
We examine the connection of two graph parameters, the size of a minimum feedback arcs set and the acyclic disconnection. A feedback arc set of a directed graph is a subset of arcs such that after deletion the graph becomes acyclic. The acyclic disconnecti ...
Elsevier2024SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generators
Nathanaël Perraudin, Andreas Loukas, Karolis Martinkus
We approach the graph generation problem from a spectral perspective by first generating the dominant parts of the graph Laplacian spectrum and then building a graph matching these eigenvalues and eigenvectors. Spectral conditioning allows for direct model ...
JMLR-JOURNAL MACHINE LEARNING RESEARCH2022The micro-world of cographs
Cographs constitute a small point in the atlas of graph classes. However, by zooming in on this point, we discover a complex world, where many parameters jump from finiteness to infinity. In the present paper, we identify several milestones in the world of ...
ELSEVIER2022Nature vs. Nurture: Feature vs. Structure for Graph Neural Networks
Karl Aberer, Thành Tâm Nguyên, Chi Thang Duong
Graph neural networks take node features and graph structure as input to build representations for nodes and graphs. While there are a lot of focus on GNN models, understanding the impact of node features and graph structure to GNN performance has received ...
ELSEVIER2022Graph Neural Networks With Lifting-Based Adaptive Graph Wavelets
Pascal Frossard, Chenglin Li, Mingxing Xu
Spectral-based graph neural networks (SGNNs) have been attracting increasing attention in graph representation learning. However, existing SGNNs are limited in implementing graph filters with rigid transforms and cannot adapt to signals residing on graphs ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022