This talk gives a general overview of discrete optimization in the context of social networks. In particular, we will focus on the maximum k-plex problem in terms of graph algorithms and in terms of a polyhedral point of view. 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, biological networks and telecommunications.
Copyright. All Rights Reserved.