Fast Polynomial Arithmetic and Exact Matchings

Leclerc, Matthias (1988) Fast Polynomial Arithmetic and Exact Matchings.
Technical Report , 5 p.

Abstract

Given a graph, a function w from E to Z + , and an integer b. A pseudo-polynomial algorithm is presented, which determines a perfect matching M of G such that the sum of w(e) over e in M equals b.


Actions:
Full text not available from this repository.
Editorial actions: View Item View Item (Login required)
Content information:
Deposit Information:
ZAIK Number: zpr88-053
Depositing User: Archive Admin
Date Deposited: 02 Apr 2001 00:00
Last Modified: 24 Nov 2011 16:14
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/53