Name
Abstract | ||
|---|---|---|
The existence of a densely knit core surrounded by a loosely connected periphery is a common macro-structural feature of social networks. Formally, the CorePeriphery problem is to partition the nodes of an undirected graph (G=(V,E)) such that a subset (Xsubset V), the core, induces a dense subgraph, and its complement (V!setminus !X), the periphery, induces a sparse subgraph. Split graphs represent the ideal case in which the core induces a clique and the periphery forms an independent set. The number of missing and superfluous edges in the core and the periphery, respectively, can be minimized in linear time via edit distance to the closest split graph. |
Year | Venue | Field |
|---|---|---|
2016 | COCOA | Edit distance,Discrete mathematics,Combinatorics,Clique,Computer science,Clique-sum,Chordal graph,Independent set,Clique (graph theory),Intersection number (graph theory),Split graph |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
6 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ulrik Brandes | 1 | 2308 | 181.69 |
| Eugenia Holm | 2 | 3 | 0.82 |
| Andreas Karrenbauer | 3 | 133 | 20.21 |