Temporal subgraph matching method for multi-connected temporal graph

DOI10.1016/J.INS.2024.121320MaRDI QIDQ6608310zbMATH OpenFDO

Authors Hanlin Zhang

Publication date 19 September 2024

Published in Information Sciences (Search for Journal in Brave)

zbMATH Keywords

subgraph matchingtemporal graphtree indexmatching graph indextemporal edge constraint

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Subgraph matching on temporal graphs
• InfMatch: finding isomorphism subgraph on a big target graph based on the importance of vertex
• Method for subgraph matching with inclusion degree
• Maximum 0-1 timed matching on temporal graphs
• Subgraph-indexed sequential subdivision for continuous subgraph matching on dynamic knowledge graph

Cites work

• An Algorithm for Subgraph Isomorphism
• Faster Subtree Isomorphism
• Method for subgraph matching with inclusion degree
• Subgraph matching on temporal graphs

Cited in

(1)

• Subgraph matching on temporal graphs

This page was built for publication: Temporal subgraph matching method for multi-connected temporal graph

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