Detecting Cohesive SubgraphsBenjamin McClosky
Rice University, Dept. of Computational and Applied Mathematics
Tuesday, March 25, 2008 15:00-16:00,
Many fundamental combinatorial optimization problems involve the search for subsets of graph elements which satisfy some notion of independence. This talk develops techniques for optimizing over a class of independence systems related to graph cohesion. Graph cohesion is a measure of mutual adjacency among a set of vertices and is relevant to the study of ad hoc wireless networks, data mining, and social network analysis.
Speaker Bio: Benjamin McClosky is a recent PhD in Computational and Applied Mathematics from Rice University. His research interests are in mathematical modeling, optimization, graph theory, network algorithms, and polyhedral combinatorics, with applications in data mining, social network analysis, biochemistry, genomics, and the analysis of general integer programs. He holds a B.S. degree in Industrial and Systems Engineering from the University of Florida.
Contact: R. F. Boisvert
Note: Visitors from outside NIST must contact Robin Bickel; (301) 975-3668; at least 24 hours in advance.