Maximal strongly connected cliques in directed graphs: algorithms and bounds (Q1983136): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:48, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximal strongly connected cliques in directed graphs: algorithms and bounds |
scientific article |
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
