Maximal strongly connected cliques in directed graphs: algorithms and bounds (Q1983136)
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 7395743
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximal strongly connected cliques in directed graphs: algorithms and bounds |
scientific article; zbMATH DE number 7395743 |
Statements
Maximal strongly connected cliques in directed graphs: algorithms and bounds (English)
0 references
15 September 2021
0 references
enumeration algorithms
0 references
bounded delay
0 references
directed graphs
0 references
community detection
0 references
network analytics
0 references
maximal cliques
0 references
0 references
0 references
0 references
0.9714003801345824
0 references
0.7572768330574036
0 references
0.755026638507843
0 references
0.7499303221702576
0 references
0.7449644207954407
0 references
