Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs

11/13/2017
by   Boris Klemz, et al.
0

A bipartite graph G=(U,V,E) is convex if the vertices in V can be linearly ordered such that for each vertex u∈ U, the neighbors of u are consecutive in the ordering of V. An induced matching H of G is a matching such that no edge of E connects endpoints of two different edges of H. We show that in a convex bipartite graph with n vertices and m weighted edges, an induced matching of maximum total weight can be computed in O(n+m) time. An unweighted convex bipartite graph has a representation of size O(n) that records for each vertex u∈ U the first and last neighbor in the ordering of V. Given such a compact representation, we compute an induced matching of maximum cardinality in O(n) time. In convex bipartite graphs, maximum-cardinality induced matchings are dual to minimum chain covers. A chain cover is a covering of the edge set by chain subgraphs, that is, subgraphs that do not contain induced matchings of more than one edge. Given a compact representation, we compute a representation of a minimum chain cover in O(n) time. If no compact representation is given, the cover can be computed in O(n+m) time. All of our algorithms achieve optimal running time for the respective problem and model. Previous algorithms considered only the unweighted case, and the best algorithm for computing a maximum-cardinality induced matching or a minimum chain cover in a convex bipartite graph had a running time of O(n^2).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/25/2019

A Weighted Approach to the Maximum Cardinality Bipartite Matching Problem with Applications in Geometric Settings

We present a weighted approach to compute a maximum cardinality matching...
research
11/20/2021

Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings

We provide CONGEST model algorithms for approximating minimum weighted v...
research
04/18/2020

Mapping Matchings to Minimum Vertex Covers: Kőnig's Theorem Revisited

It is a celebrated result in early combinatorics that, in bipartite grap...
research
02/01/2021

Graphs of Joint Types, Noninteractive Simulation, and Stronger Hypercontractivity

In this paper, we introduce the concept of a type graph, namely a bipart...
research
04/25/2019

On adaptive algorithms for maximum matching

In the fundamental Maximum Matching problem the task is to find a maximu...
research
11/08/2017

R(QPS-Serena) and R(QPS-Serenade): Two Novel Augmenting-Path Based Algorithms for Computing Approximate Maximum Weight Matching

In this addendum, we show that the switching algorithm QPS-SERENA can be...
research
10/03/2017

Maximum Matchings in Graphs for Allocating Kidney Paired Donation

Relatives and friends of an end-stage renal disease patient who offer to...

Please sign up or login with your details

Forgot password? Click here to reset