Publications related to Finding all the perfect matchings in bipartite graphs

Construction of Polar Codes With Sublinear Complexity

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

Consider the problem of constructing a polar code of block length N for a given transmission channel W. Previous approaches require one to compute the reliability of the N synthetic channels and then use only those that are sufficiently reliable. However, ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

Online Matching with General Arrivals

Ola Nils Anders Svensson, Mikhail Kapralov, Buddhima Ruwanmini Gamlath Gamlath Ralalage, Andreas Maggiori, David Wajc

The online matching problem was introduced by Karp, Vazirani and Vazirani nearly three decades ago. In that seminal work, they studied this problem in bipartite graphs with vertices arriving only on one side, and presented optimal deterministic and randomi ...

IEEE COMPUTER SOC2019

Finding Perfect Matchings in Bipartite Hypergraphs

Chidambaram Annamalai

Haxell's condition [14] is a natural hypergraph analog of Hall's condition, which is a well-known necessary and sufficient condition for a bipartite graph to admit a perfect matching. That is, when Haxell's condition holds it forces the existence of a perf ...

SPRINGER HEIDELBERG2018

On some problems related to 2-level polytopes

Manuel Francesco Aprile

In this thesis we investigate a number of problems related to 2-level polytopes, in particular from the point of view of the combinatorial structure and the extension complexity. 2-level polytopes were introduced as a generalization of stable set polytopes ...

EPFL2018

Extension complexity of stable set polytopes of bipartite graphs

Yuri Faenza, Manuel Francesco Aprile

The extension complexity xc(P) of a polytope P is the minimum number of facets of a polytope that affinely projects to P. Let G be a bipartite graph with n vertices, m edges, and no isolated vertices. Let STAB(G) be the convex hull of the stable sets of G. ...

Springer2017

The weighted stable matching problem

Linda Farczadi

We study the stable matching problem in non-bipartite graphs with incomplete but strict preference lists, where the edges have weights and the goal is to compute a stable matching of minimum or maximum weight. This problem is known to be NP-hard in general ...

2017

A semi-algebraic version of Zarankiewicz's problem

János Pach

A bipartite graph G is semi-algebraic in R-d if its vertices are represented by point sets P,Q subset of R-d and its edges are defined as pairs of points (p,q) epsilon P x Q that satisfy a Boolean combination of a fixed number of polynomial equations and i ...

European Mathematical Soc2017

Partial Recovery Bounds for the Sparse Stochastic Block Model

Volkan Cevher, Jonathan Mark Scarlett

In this paper, we study the information-theoretic limits of community detection in the symmetric two-community stochastic block model, with intra-community and inter-community edge probabilities

\frac{a}{n}

and

\frac{b}{n}

respectively. We consider the ...

Ieee2016

A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain

Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar

In this paper, we design a new iterative low-complexity algorithm for computing the Walsh-Hadamard transform (WHT) of an N dimensional signal with a K-sparse WHT. We suppose that N is a power of two and K = O(N^α), scales sub-linearly in N for some α ∈ (0, ...

Institute of Electrical and Electronics Engineers2015

Method for determining the walsh-hadamard transform of n samples of a signal and apparatus for performing the same

Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar

A computer-implemented method for determining the Walsh-Hadamard transform of N samples of a signal, comprises electing a plurality of hashing C matrices Σ1, . . . ΣC, computing C hashes of a particular length based at least on a hashing front end and the ...

2015

Finding all the perfect matchings in bipartite graphs

Graph Chatbot

Chat with Graph Search

Construction of Polar Codes With Sublinear Complexity

Online Matching with General Arrivals

Finding Perfect Matchings in Bipartite Hypergraphs

On some problems related to 2-level polytopes

Extension complexity of stable set polytopes of bipartite graphs

The weighted stable matching problem

A semi-algebraic version of Zarankiewicz's problem

Partial Recovery Bounds for the Sparse Stochastic Block Model

A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain

Method for determining the walsh-hadamard transform of n samples of a signal and apparatus for performing the same

Construction of Polar Codes With Sublinear Complexity

On some problems related to 2-level polytopes

The weighted stable matching problem

Online Matching with General Arrivals

Finding Perfect Matchings in Bipartite Hypergraphs

A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain

Extension complexity of stable set polytopes of bipartite graphs

Method for determining the walsh-hadamard transform of n samples of a signal and apparatus for performing the same

A semi-algebraic version of Zarankiewicz's problem

Partial Recovery Bounds for the Sparse Stochastic Block Model