Enumerating maximal cliques in link streams with durations (Q1705705)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Enumerating maximal cliques in link streams with durations |
scientific article; zbMATH DE number 6851038
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumerating maximal cliques in link streams with durations |
scientific article; zbMATH DE number 6851038 |
Statements
Enumerating maximal cliques in link streams with durations (English)
0 references
16 March 2018
0 references
link streams
0 references
temporal networks
0 references
time-varying graphs
0 references
cliques
0 references
graph algorithms
0 references
0 references
0.9316231608390808
0 references
0.7377951741218567
0 references
0.7326226234436035
0 references
0.7216060757637024
0 references
0.7184363603591919
0 references
