Publication

Resource Allocation for Underlaying Device-to-Device Communications Using Maximal Independent Sets and Knapsack Algorithm

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Resource Allocation for Underlaying Device-to-Device Communications Using Maximal Independent Sets and Knapsack Algorithm

Chat with Graph Search

Towards an Understanding of Hydraulic Sensitivity: Graph Theory Contributions to Water Distribution Analysis

The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al

The Power of Two Matrices in Spectral Algorithms for Community Recovery

Recovering Static and Time-Varying Communities Using Persistent Edges

Molecular hypergraph neural networks

BENIGN LANDSCAPES OF LOW-DIMENSIONAL RELAXATIONS FOR ORTHOGONAL SYNCHRONIZATION ON GENERAL GRAPHS

Results on Sparse Integer Programming and Geometric Independent Sets

Maximum Independent Set: Self-Training through Dynamic Programming

Better Trees for Santa Claus

ON THE INDEPENDENCE NUMBER OF INTERSECTION GRAPHS OF AXIS-PARALLEL SEGMENTS

Scalable maximal subgraph mining with backbone-preserving graph convolutions

Privacy-Preserving Machine Learning on Graphs

GRAMM: Fast CGRA Application Mapping Based on A Heuristic for Finding Graph Minors

Privatized graph federated learning

Equivariant Neural Architectures for Representing and Generating Graphs

A full characterization of invariant embeddability of unimodular planar graphs

Novel Ordering-based Approaches for Causal Structure Learning in the Presence of Unobserved Variables

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-constrained Cycles

Metastability of the Potts Ferromagnet on Random Regular Graphs

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-Constrained Cycles