Pattern matching in link streams: a token-based approach

DOI10.1007/978-3-319-91268-4_12zbMATH Open1427.68182OpenAlexW2801485349MaRDI QIDQ2280189FDOQ2280189

Authors: Clément Bertrand, Hanna Klaudel, Matthieu Latapy, Frédéric Peschanski 

Publication date: 18 December 2019

Full work available at URL: https://doi.org/10.1007/978-3-319-91268-4_12

Recommendations

• Pattern matching in link streams: timed-automata with finite memory
• Online timed pattern matching using automata
• Computing maximal cliques in link streams
• Enumerating maximal cliques in link streams with durations
• Temporal matching

zbMATH Keywords

complex networkstimed automatalink streamsfinite-memory automatatimed pattern recognition

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (1)

• Pattern matching in link streams: timed-automata with finite memory

This page was built for publication: Pattern matching in link streams: a token-based approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2280189)