Presents efficient algorithms for temporal butterfly counting and enumeration on temporal bipartite graphs, with reduced time complexity and extensions to streaming and multi-core settings.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs
Presents efficient algorithms for temporal butterfly counting and enumeration on temporal bipartite graphs, with reduced time complexity and extensions to streaming and multi-core settings.