The Maximum Independent Set Problem. Sarah Bleiler DIMACS REU 2005 Advisor: Dr. Vadim Lozin, RUTCOR. Definitions. Graph (G) : a network of vertices (V(G)) and edges (E(G)).
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
DIMACS REU 2005
Advisor: Dr. Vadim Lozin, RUTCOR
Claw, K1,3, S1,1,1
 A. Hertz, V.V. Lozin, The Maximum Independent Set Problem and Augmenting Graphs. Graph Theory and Combinatorial Optimization, 1:1-32, 2005.
 Eric W. Weisstein. "Maximum Independent Set." From Mathworld--A Wolfram Web Resource.<http://mathworld.wolfram.com/Ma ximumIndependentSet.html>