Two polynomial algorithms for special maximum matching constructing in trees
arXiv:0707.2295
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.
55 pages, 38 figures, Submitted to Discrete Applied Mathematics
References in corpus (1)
Cited by in corpus (4)
- On complexity of special maximum matchings constructing
- Characterization Of A Class Of Graphs Related To Pairs Of Disjoint Matchings
- Three results towards the approximation of special maximum matchings in graphs
- On a constructive characterization of a class of trees related to pairs of disjoint matchings