Publications associées à Degree-constrained edge partitioning in graphs arising from discrete tomography

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

The power of adaptivity in source identification with time queries on the path

Patrick Thiran, Gergely Odor, Victor Cyril L Lecomte

We study the problem of identifying the source of a stochastic diffusion process spreading on a graph based on the arrival times of the diffusion at a few queried nodes. In a graph

G=(V,E)

, an unknown source node

v^* \in V

is drawn uniformly at random, ...

2022

Degree-constrained edge partitioning in graphs arising from discrete tomography

Graph Chatbot

Chattez avec Graph Search

Space-Efficient Representations of Graphs

SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generators

A Unified Experiment Design Approach for Cyclic and Acyclic Causal Models

On the robustness of the metric dimension of grid graphs to adding a single edge

Generalised Implicit Neural Representations

Incompleteness of graph neural networks for points clouds in three dimensions

Planted matching problems on random hypergraphs

The power of adaptivity in source identification with time queries on the path

Annihilation Filter Approach For Estimating Graph Dynamics From Diffusion Processes

Representing graphs through data with learning and optimal transport

Space-Efficient Representations of Graphs

SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generators

Generalised Implicit Neural Representations

A Unified Experiment Design Approach for Cyclic and Acyclic Causal Models

Incompleteness of graph neural networks for points clouds in three dimensions

Planted matching problems on random hypergraphs

On the robustness of the metric dimension of grid graphs to adding a single edge

The power of adaptivity in source identification with time queries on the path

Annihilation Filter Approach For Estimating Graph Dynamics From Diffusion Processes

Representing graphs through data with learning and optimal transport