Two polynomial algorithms for special maximum matching constructing in trees
Discrete Mathematics
2007-07-17 v1
Abstract
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.
Keywords
Cite
@article{arxiv.0707.2295,
title = {Two polynomial algorithms for special maximum matching constructing in trees},
author = {R. R. Kamalian and V. V. Mkrtchyan},
journal= {arXiv preprint arXiv:0707.2295},
year = {2007}
}
Comments
55 pages, 38 figures, Submitted to Discrete Applied Mathematics