Enumerating maximal cliques in link streams with durations (Q1705705): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An Analysis of Some Graph Theoretical Cluster Techniques / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithm 457: finding all cliques of an undirected graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Listing All Maximal Cliques in Large Sparse Real-World Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: What's in a crowd? Analysis of face-to-face behavioral networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The worst-case time complexity for generating all maximal cliques and computational experiments / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Enumerating maximal cliques in link streams with durations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing maximal cliques in link streams / rank | |||
Normal rank | |||
Revision as of 07:47, 15 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Enumerating maximal cliques in link streams with durations |
scientific article |
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
