Pseudoflow Bipartite Matching Solvers Version 1.01

The solver solves a single instance of the maximum cardinality bipartite matching problem using the pseudoflow algorithm.

License Information

The source code is subject to the following academic license. Note this is not an open source license.

Copyright © 2001. The Regents of the University of California (Regents). All Rights Reserved.

Permission to use, copy, modify, and distribute this software and its documentation for educational, research, and not-for-profit purposes, without fee and without a signed licensing agreement, is hereby granted, provided that the above copyright notice, this paragraph and the following two paragraphs appear in all copies, modifications, and distributions. Contact The Office of Technology Licensing, UC Berkeley, 2150 Shattuck Avenue, Suite 510, Berkeley, CA 94720-1620, (510) 643-7201, for commercial licensing opportunities. Created by Bala Chandran and Dorit S. Hochbaum, Department of Industrial Engineering and Operations Research, University of California, Berkeley.

IN NO EVENT SHALL REGENTS BE LIABLE TO ANY PARTY FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES, INCLUDING LOST PROFITS, ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF REGENTS HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

REGENTS SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE AND ACCOMPANYING DOCUMENTATION, IF ANY, PROVIDED HEREUNDER IS PROVIDED "AS IS". REGENTS HAS NO OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.

Source Code

The source is available as a tar file [pseudo-bip-1.01.tar].

Installation Instructions

The code is designed to compile under gcc on a unix system. After downloading the file, run the following commands:
tar -xvf pseudo-bip-1.01.tar
This will create a folder named "pseudo_bip". Enter this directory and type
make
This will create eight executables in the "bin/" directory:

pseudo_fifo: Highest label pseudoflow algorithm with FIFO buckets.
pseudo_lifo: Highest label pseudoflow algorithm with LIFO buckets.
pseudo_wave: Highest label pseudoflow algorithm with Wave buckets.
pseudo_lo_fifo: Lowest label pseudoflow algorithm with FIFO buckets.
pseudo_lo_lifo: Lowest label pseudoflow algorithm with LIFO buckets.
hi_free: Highest label free-arcs pseudoflow algorithm.
lo_free: Lowest label free-arcs pseudoflow algorithm.
matching_pseudoflow: The matching-pseudoflow algorithm.

The lo_free code is in general the fastest of the implementations.

Usage

The input file is assumed to be in modified DIMACS format:

c < Comment lines > p bipartite-matching <# vertices in U = n_u> <# vertices in V = n_v> <# edges> a < left-node > < right-node >
The last kind of line should be repeated for each edge present in the input graph. Vertices in *each* partition are numbered from 1 consecutively up to n_u (or n_v).

The input is read from stdin and output is written to stdout. See the "README" file for further details on usage.