Publications associées à Factor-critical graph

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.

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

Asynchronous Decoding of LDPC Codes over BEC

Amin Karbasi, Amir Hesam Salavati, Saeid Haghighatshoar

LDPC codes are typically decoded by running a synchronous message passing algorithm over the corresponding bipartite factor graph (made of variable and check nodes). More specifically, each synchronous round consists of 1) updating all variable nodes based ...

2015

Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition

Yuri Faenza, Gautier Stauffer

We propose an algorithm for solving the maximum weighted stable set problem on claw-free graphs that runs in O(vertical bar V vertical bar (vertical bar E vertical bar+vertical bar V vertical bar log vertical bar V vertical bar))-time, drastically improvin ...

Assoc Computing Machinery2014

On the Performance of Percolation Graph Matching

Matthias Grossglauser, Lyudmila Yartseva

Graph matching is a generalization of the classic graph isomorphism problem. By using only their structures a graph-matching algorithm finds a map between the vertex sets of two similar graphs. This has applications in the de-anonymization of social and in ...

ACM2013

Correlation-Aware Reconstruction of Network Coded Sources

Pascal Frossard, Nikolaos Thomos, Eirina Bourtsoulatze

In this paper, we consider the problem of decoding network coded correlated data when the decoder does not receive sufficient information for exact decoding. We propose an iterative decoding algorithm based on belief propagation that efficiently exploits t ...

2012

Mmse Denoising Of Sparse Levy Processes Via Message Passing

Michaël Unser, Arash Amini, Ulugbek Kamilov

Many recent algorithms for sparse signal recovery can be interpreted as maximum-a-posteriori (MAP) estimators relying on some specific priors. From this Bayesian perspective, state-of-the-art methods based on discrete-gradient regularizers, such as total-v ...

Ieee2012

MMSE Denoising of Sparse Lévy Processes via Message Passing

Michaël Unser, Azin Amini, Ulugbek Kamilov

IEEE2012

Approximating Graphic TSP by Matchings

Ola Nils Anders Svensson

We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges in order to make a given graph Eulerian, whereas our approach also allows for the removal of certain edges leadi ...

IEEE Computer Society2011

Factor-critical graph

Graph Chatbot

Chattez avec Graph Search

On random subgraphs of Kneser and Schrijver graphs

Reconciling Factor Graph with User Feedback

Asynchronous Decoding of LDPC Codes over BEC

Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition

On the Performance of Percolation Graph Matching

Correlation-Aware Reconstruction of Network Coded Sources

Mmse Denoising Of Sparse Levy Processes Via Message Passing

MMSE Denoising of Sparse Lévy Processes via Message Passing

An algorithmic decomposition of claw-free graphs leading to an O(n^3) algorithm for the weighted stable set problem

Approximating Graphic TSP by Matchings

On random subgraphs of Kneser and Schrijver graphs

MMSE Denoising of Sparse Lévy Processes via Message Passing

Asynchronous Decoding of LDPC Codes over BEC

Approximating Graphic TSP by Matchings

An algorithmic decomposition of claw-free graphs leading to an O(n^3) algorithm for the weighted stable set problem

Reconciling Factor Graph with User Feedback

Mmse Denoising Of Sparse Levy Processes Via Message Passing

On the Performance of Percolation Graph Matching

Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition

Correlation-Aware Reconstruction of Network Coded Sources