AI Chat AI Image Generator AI Video Text to Speech

Codes parameterized by the edges of a bipartite graph with a perfect matching

09/26/2022

∙

by Manuel Gonzalez-Sarabia, et al.

∙

∙

In this paper we study the main characteristics of some evaluation codes parameterized by the edges of a bipartite graph with a perfect matching.

Manuel Gonzalez-Sarabia
3 publications
Rafael H. Villarreal
9 publications

page 1

page 2

page 3

page 4

research

∙ 10/12/2020

An Extension of the Birkhoff-von Neumann Theorem to Non-Bipartite Graphs

We prove that a fractional perfect matching in a non-bipartite graph can...

0 Vijay V. Vazirani, et al. ∙

research

∙ 09/20/2017

Complexity of Finding Perfect Bipartite Matchings Minimizing the Number of Intersecting Edges

Consider a problem where we are given a bipartite graph H with vertices ...

0 Grzegorz Guśpiel, et al. ∙

research

∙ 03/19/2020

A Real Polynomial for Bipartite Graph Minimum Weight Perfect Matchings

In a recent paper, Beniamini and Nisan <cit.> gave a closed-form formula...

0 Karthik Gajulapalli, et al. ∙

research

∙ 01/29/2019

A Pseudo-Deterministic RNC Algorithm for General Graph Perfect Matching

The difficulty of obtaining an NC perfect matching algorithm has led res...

0 Nima Anari, et al. ∙

research

∙ 04/15/2022

Finding Hall blockers by matrix scaling

For a given nonnegative matrix A=(A_ij), the matrix scaling problem asks...

0 Koyo Hayashi, et al. ∙

research

∙ 04/26/2019

Parameterized algorithms for Partial vertex covers in bipartite graphs

In the weighted partial vertex cover problem (WPVC), we are given a grap...

0 Vahan Mkrtchyan, et al. ∙

research

∙ 07/02/2021

Sequential importance sampling for estimating expectations over the space of perfect matchings

This paper makes three contributions to estimating the number of perfect...

0 Yeganeh Alimohammadi, et al. ∙