Abstract
A matching M is called flexible if there exists an alternating cycle with respect to M. Given a graph G = (V, E) and S ⊆ V, a flexible matching M ⊂ E is sought which covers a maximum number of vertices belonging to S. It is proved that the existence of such a matching is decidable in O(|V|·me, and a concrete flexible maximum S-matching can also be found in the same amount of time. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Bartha, M., & Krész, M. (2006). Flexible matchings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4271 LNCS, pp. 313–324). Springer Verlag. https://doi.org/10.1007/11917496_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
