Show simple item record

dc.contributor.authorWood, Cynthia Ivette
dc.date.accessioned 2018-06-19T17:50:45Z
dc.date.available 2018-06-19T17:50:45Z
dc.date.issued 2016-05
dc.identifier.citation Wood, Cynthia Ivette. "Clique Generalizations and Related Problems." (2016) http://hdl.handle.net/1911/102243.
dc.identifier.urihttp://hdl.handle.net/1911/102243
dc.descriptionThis work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/96187
dc.description.abstract A large number of real-world problems can be model as optimization problems in graphs. The clique model was introduced to aid the study of network structure for social interaction. Each vertex represented an actor and the edges represented the relations between them. Nevertheless, the model has been shown to be restrictive for modeling real-world problems, since it leaves out subgraphs that do not have all possible edges. As a consequence, clique generalizations were introduced to overcome the disadvantages of the clique model. In this thesis, I present three computationally difficult combinatorial optimization problems related to clique generalization problems: co-2-plexes and k-cores. A k-core is a subgraph with minimum degree greater than or equal to k. In this work, I discuss the minimal k-core problem and the minimum k-core problem. I present a backtracking algorithm to find all minimal k-cores of a given undirected graph and its applications to the study of associative memory. The proposed method is a modification of the Bron and Kerbosch algorithm for finding all cliques of an undirected graph. In addition, I study the polyhedral structure of the k-core polytope. The minimum k-core problem is modeled as a binary integer program and relaxed as a linear program. Since the relaxation yields to a non-integral solution, cuts must be added in order to improve the solution. I show that edge and cycle transversals of the graph give valid inequalities for the convex hull of k-cores. A set of pairwise non-adjacent vertices defines a stable set. A stable set is the complement of a clique. A co-2-plex is a subgraph with degree less than or equal to one, and it is a stable set relaxation. I introduce a study of the maximum weighted co-2-plex (MWC2P) problem for {claw, bull}-free graphs and present two polynomial time algorithms to solve it. One of the algorithms transforms the original graph to solve an instance of the maximum weighted stable set problem utilizing Minty’s algorithm. The second algorithm is an extension of Minty’s algorithm and solves the problem in the original graph. All the algorithms discussed in this thesis were implemented and tested. Numerical results are provided for each one of them.
dc.format.extent 126 pp
dc.title Clique Generalizations and Related Problems
dc.type Technical report
dc.date.note May 2016
dc.identifier.digital TR16-03
dc.type.dcmi Text


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record