Introduces consistent event graph isomorphism and a temporal Weisfeiler-Leman algorithm to analyze and improve the expressive power of message passing in temporal event graphs.
How powerful are graph neural networks? In 7th International Conference on Learning Representations, ICLR 2019
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Weisfeiler and Leman Follow the Arrow of Time: Expressive Power of Message Passing in Temporal Event Graphs
Introduces consistent event graph isomorphism and a temporal Weisfeiler-Leman algorithm to analyze and improve the expressive power of message passing in temporal event graphs.