Abstract

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

Publication Date

2009

Document Type

Thesis

Department, Program, or Center

Computer Science (GCCIS)

Advisor

Bezakova, Ivona

Comments

Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works. Physical copy available through RIT's The Wallace Library at: QA164.8 .R86 2009

Campus

RIT – Main Campus

Download

Share

COinS