Fast algorithms for determining (generalized) core groups in social networks (Q2442801): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: \(k\)-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3043782 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: \(k\)-core architecture and \(k\)-core percolation on complex networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Asymptotic normality of the \(k\)-core in random graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4397004 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An upper bound for the chromatic number of a graph and its application to timetabling problems / rank | |||
Normal rank | |||
Latest revision as of 12:36, 7 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast algorithms for determining (generalized) core groups in social networks |
scientific article |
Statements
Fast algorithms for determining (generalized) core groups in social networks (English)
0 references
1 April 2014
0 references
core
0 references
large network
0 references
decomposition
0 references
graph algorithm
0 references
0 references
