On greedy matching ordering and greedy matchable graphs [chapter]

Feodor F. Dragan
1997 Lecture Notes in Computer Science  
In this note a greedy algorithm is considered that computes a matching for a graph with a given ordering of its vertices, and those graphs are studied for which a vertex ordering exists such that the greedy algorithm always yields maximum cardinality matchings for each induced subgraph. We show that these graphs, called greedy matchable graphs, are a subclass of weakly triangulated graphs and contain strongly chordal graphs and chordal bipartite graphs as proper subclasses. The question when
more » ... this ordering be produced efficiently is discussed too.
doi:10.1007/bfb0024498 fatcat:fuay63zsrfespkb4fqtohswmsy