Two polynomial algorithms for special maximum matching constructing in trees
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
For an arbitrary tree we investigate the problems of constructing a maximum matching which minimizes or maximizes the cardinality of a maximum matching of the graph obtained from original one by its removal and present corresponding polynomial algorithms.
55 pages, 38 figures, Submitted to Discrete Applied Mathematics
55 pages, 38 figures, Submitted to Discrete Applied Mathematics