![An efficient graph clustering algorithm by exploiting k-core decomposition and motifs - ScienceDirect An efficient graph clustering algorithm by exploiting k-core decomposition and motifs - ScienceDirect](https://ars.els-cdn.com/content/image/1-s2.0-S0045790621005061-ga1.jpg)
An efficient graph clustering algorithm by exploiting k-core decomposition and motifs - ScienceDirect
![computer science - Finding the largest k-clique, k-club, k-plex, and k-core of a small undirected graph. - Mathematics Stack Exchange computer science - Finding the largest k-clique, k-club, k-plex, and k-core of a small undirected graph. - Mathematics Stack Exchange](https://i.stack.imgur.com/1l7KW.png)
computer science - Finding the largest k-clique, k-club, k-plex, and k-core of a small undirected graph. - Mathematics Stack Exchange
![Example of a disconnected k-core subgraph. The 2-core is shown in a.... | Download Scientific Diagram Example of a disconnected k-core subgraph. The 2-core is shown in a.... | Download Scientific Diagram](https://www.researchgate.net/publication/337008832/figure/fig9/AS:960329408331803@1605971781416/Example-of-a-disconnected-k-core-subgraph-The-2-core-is-shown-in-a-The-removal-of-the.png)
Example of a disconnected k-core subgraph. The 2-core is shown in a.... | Download Scientific Diagram
![IJGI | Free Full-Text | A Knowledge Discovery Method for Landslide Monitoring Based on K-Core Decomposition and the Louvain Algorithm IJGI | Free Full-Text | A Knowledge Discovery Method for Landslide Monitoring Based on K-Core Decomposition and the Louvain Algorithm](https://www.mdpi.com/ijgi/ijgi-11-00217/article_deploy/html/images/ijgi-11-00217-g003.png)