Add to ORKGA clique model is one of the most important techniques on the cohesive subgraph detection; however, its applications are rather limited due to restrictive conditions of the model. Hence much research resorts to k-plex — a graph in which any vertex is adjacent to all but at most k vertices — which is a relaxation model of the clique. In this paper, we study the maximum k-plex problem and propose a fast algorithm to compute maximum k-plexes by exploiting structural properties of the problem. In an n-vertex graph, the algorithm computes optimal solutions in cnnO(1) time for a constant c < 2 depending only on k. To the best of our knowledge, this is the first algorithm that breaks the trivial theoretical bound of 2n for each k ≥ 3. We also p...
International audienceIt is widely accepted that an ideal community in networks is the one whose str...
International audienceIt is widely accepted that an ideal community in networks is the onewhose stru...
In a graph, a k-plex is a vertex set in which every vertex is not adjacent to at most k vertices of ...
This paper introduces and studies the maximum k-plex problem, which arises in social network analysi...
This paper introduces and studies the maximum k-plex problem, which arises in social network analysi...
The problem of enumerating all maximal cliques in a graph is a key primitive in a variety of real-wo...
The maximum clique problem provides a classic framework for detecting cohesive sub-graphs. However, ...
We propose a fast, parallel, maximum clique algorithm for large, sparse graphs that is designed to e...
k-plexes are a formal yet flexible way of defining communities in networks. They generalize the noti...
We focus on the automatic detection of communities in large networks, a challenging problem in many ...
We focus on the automatic detection of communities in large networks, a challenging problem in many ...
We focus on the automatic detection of communities in large networks, a challenging problem in many ...
k-plexes are a formal yet flexible way of defining communities in networks. They generalize the noti...
We focus on the automatic detection of communities in large networks, a challenging problem in many ...
k-plexes are a formal yet flexible way of defining communities in networks. They generalize the noti...
International audienceIt is widely accepted that an ideal community in networks is the one whose str...
International audienceIt is widely accepted that an ideal community in networks is the onewhose stru...
In a graph, a k-plex is a vertex set in which every vertex is not adjacent to at most k vertices of ...
This paper introduces and studies the maximum k-plex problem, which arises in social network analysi...
This paper introduces and studies the maximum k-plex problem, which arises in social network analysi...
The problem of enumerating all maximal cliques in a graph is a key primitive in a variety of real-wo...
The maximum clique problem provides a classic framework for detecting cohesive sub-graphs. However, ...
We propose a fast, parallel, maximum clique algorithm for large, sparse graphs that is designed to e...
k-plexes are a formal yet flexible way of defining communities in networks. They generalize the noti...
We focus on the automatic detection of communities in large networks, a challenging problem in many ...
We focus on the automatic detection of communities in large networks, a challenging problem in many ...
We focus on the automatic detection of communities in large networks, a challenging problem in many ...
k-plexes are a formal yet flexible way of defining communities in networks. They generalize the noti...
We focus on the automatic detection of communities in large networks, a challenging problem in many ...
k-plexes are a formal yet flexible way of defining communities in networks. They generalize the noti...
International audienceIt is widely accepted that an ideal community in networks is the one whose str...
International audienceIt is widely accepted that an ideal community in networks is the onewhose stru...
In a graph, a k-plex is a vertex set in which every vertex is not adjacent to at most k vertices of ...