Seminar
| Parent Program: | -- |
|---|---|
| Location: | SLMath: Baker Board Room |
Keywords and Mathematics Subject Classification (MSC)
Primary Mathematics Subject Classification
No Primary AMS MSC
Secondary Mathematics Subject Classification
No Secondary AMS MSC
This talk gives a general overview of discrete optimization and its relationship with network analysis. In particular, we will concentrate on the maximum k-plex problem which characterizes some degree of cohesiveness within a network. The maximum k-plex problem was first introduced in the context of social network analysis but can be utilized in other applications like graph-based data mining, wireless networks, and telecommunications.
No Notes/Supplements Uploaded No Video Files Uploaded