Flexible matchings

Authors:
Miklós Bartha;Miklós Krész
Affiliations:
Memorial University of Newfoundland, St. John's, Canada;University of Szeged, Szeged, Hungary
Venue:
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Year:
2006

Citing 7
Cited 1

Soliton automata

Journal of Computer and System Sciences
A structure theorem for maximum internal matchings in graphs

Information Processing Letters
Unique maximum matching algorithms

Journal of Algorithms
Structuring the elementary components of graphs having a perfect internal matching

Theoretical Computer Science
Tutte type theorems for graphs having a perfect internal matching

Information Processing Letters
Matching Theory (North-Holland mathematics studies)

Matching Theory (North-Holland mathematics studies)
The symmetric alldiff constraint

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1

Soliton automata with constant external edges

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

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 time, and a concrete flexible maximum S-matching can also be found in the same amount of time.