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

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.

Scaling a Reliable Distributed System

Alexandre David Olivier Maurer

We consider the problem of reliably connecting an arbitrarily large set of computers (nodes) with communication channels. Reliability means here the ability, for any two nodes, to remain connected (i.e., their ability to communicate) with probability at le ...

LPD EPFL2016

Assembling a Network out of Ambiguous Patches

Matthias Grossglauser, Lyudmila Yartseva, Jefferson Elbert Simões

Many graph mining and network analysis problems rely on the availability of the full network over a set of nodes. But inferring a full network is sometimes non-trivial if the raw data is in the form of many small {\em patches} or subgraphs, of the true net ...

2016

Tracking Time-Vertex Propagation using Dynamic Graph Wavelets

Nathanaël Perraudin, Benjamin Ricaud, Francesco Grassi

Graph Signal Processing generalizes classical signal processing to signal or data indexed by the vertices of a weighted graph. So far, the research efforts have been focused on static graph signals. However numerous applications involve graph signals evolv ...

2016

On random subgraphs of Kneser and Schrijver graphs

Andrei Kupavskii

A Kneser graph KG(n,k) is a graph whose vertices are in oneto-one correspondence with k -element subsets of [n], with two vertices connected if and only if the corresponding sets do not intersect. A famous result due to Lowisz states that the chromatic num ...

Academic Press Inc Elsevier Science2016

Graph-Based Representation and Coding of Multiview Images

Pascal Frossard, Bénédicte Motz

Instead of lossily coding depth images resulting in undesirable geometric distortion, graph-based representation (GBR) describes disparity information as a graph with a controllable accuracy. In this paper, we propose a more compact graphical representatio ...

Ieee2016

On the Difficulty of Selecting Ising Models with Approximate Recovery

Volkan Cevher, Jonathan Mark Scarlett

In this paper, we consider the problem of estimating the underlying graph associated with an Ising model given a number of independent and identically distributed samples. We adopt an approximate recovery criterion that allows for a number of missed edges ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Constant Factor Approximation for ATSP with Two Edge Weights

Ola Nils Anders Svensson, Jakub Tarnawski

We give a constant factor approximation algorithm for the Asymmetric Traveling Salesman Problem on shortest path metrics of directed graphs with two different edge weights. For the case of unit edge weights, the first constant factor approximation was give ...

Springer Int Publishing Ag2016

Source Localization on Graphs via l1 Recovery and Spectral Graph Theory

Pierre Vandergheynst, Xavier Bresson, Rodrigo Cerqueira Gonzalez Pena

We cast the problem of source localization on graphs as the simultaneous problem of sparse recovery and diffusion ker- nel learning. An l1 regularization term enforces the sparsity constraint while we recover the sources of diffusion from a single snapshot ...

Ieee2016

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

Graph Chatbot

Chat with Graph Search

Scaling a Reliable Distributed System

Assembling a Network out of Ambiguous Patches

Tracking Time-Vertex Propagation using Dynamic Graph Wavelets

On random subgraphs of Kneser and Schrijver graphs

From data to structures

Deconvolution of Gaussian Random Fields using the Graph Fourier Transform

Graph-Based Representation and Coding of Multiview Images

On the Difficulty of Selecting Ising Models with Approximate Recovery

Constant Factor Approximation for ATSP with Two Edge Weights

Source Localization on Graphs via l1 Recovery and Spectral Graph Theory

Scaling a Reliable Distributed System

On random subgraphs of Kneser and Schrijver graphs

Assembling a Network out of Ambiguous Patches

Tracking Time-Vertex Propagation using Dynamic Graph Wavelets

From data to structures

Deconvolution of Gaussian Random Fields using the Graph Fourier Transform

Graph-Based Representation and Coding of Multiview Images

Constant Factor Approximation for ATSP with Two Edge Weights

On the Difficulty of Selecting Ising Models with Approximate Recovery

Source Localization on Graphs via l1 Recovery and Spectral Graph Theory