Graph theoretic generalizations of clique: optimization and extensions
This dissertation considers graph theoretic generalizations of the maximum clique problem. Models that were originally proposed in social network analysis literature, are investigated from a mathematical programming perspective for the first time. A social network is usually represented by a graph,...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1969.1/ETD-TAMU-1539 http://hdl.handle.net/1969.1/ETD-TAMU-1539 |