Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem (Q3013924): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.1100.0851 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2169088933 / rank | |||
Normal rank | |||
Revision as of 02:21, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem |
scientific article |
Statements
Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem (English)
0 references
19 July 2011
0 references
maximum \(k\)-plex problem
0 references
maximum clique problem
0 references
social network analysis
0 references
clique relaxations
0 references
cohesive subgroups
0 references
scale-free graphs
0 references
power law graphs
0 references
