undirected graph G=(V,E) mtelinofdpof matchings amstnormindpetf matchingundirected graph G = (V,E) approximately counting # of of G matchings {independent sets} almost uniformly sampling a of G matching {independent set}