Two polynomial algorithms for special maximum matching constructing in trees
R.R. Kamalian, V. V. Mkrtchyan
TL;DR
This paper presents polynomial algorithms for constructing maximum matchings in trees that optimize the size of maximum matchings after removing the matched edges, addressing a specific problem in graph theory.
Contribution
The paper introduces two polynomial algorithms for special maximum matching construction in trees, focusing on optimizing the maximum matching size after removal.
Findings
Algorithms run in polynomial time.
Effective in constructing matchings with desired properties.
Addresses a specific problem in maximum matching theory.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Graph Theory and Algorithms