On maximal cliques with connectivity constraints in directed graphs (Q5136240)
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 7278028
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On maximal cliques with connectivity constraints in directed graphs |
scientific article; zbMATH DE number 7278028 |
Statements
25 November 2020
0 references
enumeration algorithms
0 references
bounded delay
0 references
directed graphs
0 references
community structure
0 references
network analytics
0 references
0 references
0 references
0.9714003801345824
0 references
0.7628825306892395
0 references
0.7618306875228882
0 references
0.7554624676704407
0 references
0.753042459487915
0 references
