Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem (Q3013924): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Q200487 / rank | |||
Property / author | |||
Property / author: Sergiy I. Butenko / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Pajek datasets / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 03: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