Optimum matching forests I: Special weights |
| |
Authors: | Rick Giles |
| |
Institution: | (1) Department of Mathematics, University of Kentucky, 40506 Lexington, KY, USA |
| |
Abstract: | We introduce the concept of matching forests as a generalization of branchings in a directed graph and matchings in an undirected graph. Given special weights on the edges of a mixed graph, we present an efficient algorithm for finding an optimum weight-sum matching forest. The algorithm is a careful application of known branching and matching algorithms. The maximum cardinality matching forest problem is solved as a special case.Research partially supported by a N.R.C. of Canada Postdoctorate Fellowship. |
| |
Keywords: | Graph Matching Branching Linear Programming |
本文献已被 SpringerLink 等数据库收录! |
|