Subgraph matching on temporal graphs

DOI10.1016/j.ins.2021.07.071zbMath1530.68202OpenAlexW3184828161MaRDI QIDQ6089960

Zhao-Nian Zou, Faming Li

Publication date: 15 December 2023

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2021.07.071

zbMATH Keywords

indextemporal ordersubgraph matchingtemporal graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Information storage and retrieval of data (68P20)

Cites Work

• Unnamed Item
• Unnamed Item
• SQBC: an efficient subgraph matching method over large and dense graphs
• Fifty years of graph matching, network alignment and network comparison
• Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs
• Mining weighted subgraphs in a single large graph
• An Algorithm for Subgraph Isomorphism
• When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases