Finding dense subgraphs with maximum weighted triangle density (Q2666852)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7432090
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding dense subgraphs with maximum weighted triangle density |
scientific article; zbMATH DE number 7432090 |
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
0 references
0.8088833689689636
0 references
0.8079357147216797
0 references
0.8044591546058655
0 references
0.8026052117347717
0 references
0.7928371429443359
0 references
