1. Greedy Algorithm for approximation of the Maximum Induced Matching problem in regular graphs of girth at least six Open Access Author: Patel, Chaitanya Title: Greedy Algorithm for approximation of the Maximum Induced Matching problem in regular graphs of girth at least six Area of Honors: Computer Science Keywords: Graph TheoryInduced MatchingRegular graphsComputer Science File: Download Patel_Chaitanya_inducedmatchinginregulargraphs.pdf Thesis Supervisors: Piotr Berman, Thesis SupervisorDr. John Joseph Hannan, Thesis Honors Advisor
