加载中…
2007-07-16
Two polynomial algorithms for special maximum matching constructing in trees
R. R. KamalianV. V. Mkrtchyan
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本