Finding dense subgraphs with maximum weighted triangle density (Q2666852)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding dense subgraphs with maximum weighted triangle density |
scientific article |
Statements
Finding dense subgraphs with maximum weighted triangle density (English)
0 references
23 November 2021
0 references
dense subgraph
0 references
near-clique extraction
0 references
graph mining
0 references
minimum cut
0 references
graph algorithms
0 references
0 references
0 references
