The random generation or sampling of combinatorial objects has important applications to statistical analyses in various domains, including physics and evolutionary biology. Some objects whose sampling has been well-studied are contingency tables, matchings, and independent sets. Edge covers are related to matchings in graph theory; however, their association does not appear to be of the sort where results for sampling matchings imply results for sampling edge covers. Consequently, we investigate the sampling of edge covers and prove that efficiently sampling so-called (1,2)-edge covers is possible under reasonable restrictions.
Library of Congress Subject Headings
Combinatorial enumeration problems; Graph theory
Department, Program, or Center
Computer Science (GCCIS)
Rummler, William August, "Sampling edge covers" (2009). Thesis. Rochester Institute of Technology. Accessed from
RIT – Main Campus