Can I read Two Polynomial Algorithms for Special Maximum Matching Constructing in Trees on EtoBox?

Two Polynomial Algorithms for Special Maximum Matching Constructing in Trees by Kamalian, R. R.; Mkrtchyan, V. V. is a scholarly article available to read on EtoBox.

What is Two Polynomial Algorithms for Special Maximum Matching Constructing in Trees about?

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.

Author

Kamalian, R. R.; Mkrtchyan, V. V.

Published

2007

Language

EN