On the maximum 2-1 matching

Document Type

Article

Publication Date

10-1-1987

Abstract

Given a simple bipartite graph G=(X,Y, E). M {Mathematical expression}E is called a 2-1 matching of G if: 1) ∀x εX, either two edges or none in M is incident to x and 2) ∀y εY, at most one edge in M is incident to y. In this paper, we describe an efficient algorithm for finding a maximum 2-1 matching in a given bipartite graph. We also formulate and prove a duality theorem for 2-1 matching. © 1987 Science Press, Beijing, China and Allerton Press, Inc. New York, U.S.A.

Publication Source (Journal or Book title)

Acta Mathematicae Applicatae Sinica

First Page

305

Last Page

312

This document is currently not available here.

Share

COinS