Concept
Coloration des arêtes d'un graphe
Publications associées (169)
A Note on Lenses in Arrangements of Pairwise Intersecting Circles in the Plane
Let F be a family of n pairwise intersecting circles in the plane. We show that the number of lenses, that is convex digons, in the arrangement induced by F is at most 2n - 2. This bound is tight. Furthermore, if no two circles in F touch, then the geometr ...
Electronic Journal Of Combinatorics2024The 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 ...
Elsevier2024The Power of Two Matrices in Spectral Algorithms for Community Recovery
Spectral algorithms are some of the main tools in optimization and inference problems on graphs. Typically, the graph is encoded as a matrix and eigenvectors and eigenvalues of the matrix are then used to solve the given graph problem. Spectral algorithms ...
Ieee-Inst Electrical Electronics Engineers Inc2024Differentially private multi-agent constraint optimization
Boi Faltings, Sujit Prakash Gujar, Aleksei Triastcyn, Sankarshan Damle
Distributed constraint optimization (DCOP) is a framework in which multiple agents with private constraints (or preferences) cooperate to achieve a common goal optimally. DCOPs are applicable in several multi-agent coordination/allocation problems, such as ...
Dordrecht2024DiGress: Discrete Denoising diffusion for graph generation
Pascal Frossard, Volkan Cevher, Igor Krawczuk, Bohan Wang, Clément Arthur Yvon Vignac
This work introduces DiGress, a discrete denoising diffusion model for generating graphs with categorical node and edge attributes. Our model utilizes a discrete diffusion process that progressively edits graphs with noise, through the process of adding or ...
2023GAP: Differentially Private Graph Neural Networks with Aggregation Perturbation
Daniel Gatica-Perez, Sina Sajadmanesh
In this paper, we study the problem of learning Graph Neural Networks (GNNs) with Differential Privacy (DP). We propose a novel differentially private GNN based on Aggregation Perturbation (GAP), which adds stochastic noise to the GNN's aggregation functio ...
Berkeley2023GRAMM: Fast CGRA Application Mapping Based on A Heuristic for Finding Graph Minors
Mirjana Stojilovic, Guanglei Zhou
A graph H is a minor of a second graph G if G can be transformed into H by two operations: 1) deleting nodes and/or edges, or 2) contracting edges. Coarse-grained reconfigurable array (CGRA) application mapping is closely related to the graph minor problem ...
2023Graph neural networks for dynamic modeling of roller bearings
Machine learning has paved the way for the real-time monitoring of complex infrastructure and industrial systems. However, purely data-driven methods have not been able to learn the underlying dynamics and generalize them to operating conditions that have ...
PHM Society2023