Paths Around Obstacles

Al Jubeh, Marwan Ibrahim
2010

Connectivity augmentation is an important area of study in optimization. For a given graph, a connectivity augmentation problem asks to augment the graph (add edges) such that the augmented graph has the desired connectivity. Motivated by the problem of making a given non-crossing geometric graph 3-vertex connected, we consider the following augmentation problem: for a non-crossing geometric graph... read more

This object is in collection:
Undergraduate honors theses
Subjects
Department of Computer Science
Permanent URL
http://hdl.handle.net/10427/70355
ID: tufts:UA005.036.005.00001
To Cite: DCA Citation Guide
Usage: Detailed Rights