Maximal strongly connected cliques in directed graphs: algorithms and bounds (Q1983136): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 457 / rank | |||
Normal rank | |||
Revision as of 01:52, 1 March 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
