Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs

DOI10.1016/j.ins.2019.01.036zbMath1446.68127OpenAlexW2909271600WikidataQ128575099 ScholiaQ128575099MaRDI QIDQ2212077

Junhu Wang, Shikha Anirban, Xuguang Ren, Xin-Wen Wu

Publication date: 17 November 2020

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

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

zbMATH Keywords

filteringsubgraph isomorphismcompressed graph

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Mining weighted subgraphs in a single large graph, Subgraph matching on temporal graphs

Uses Software

• GADDI

Cites Work

• 基于图压缩的最大Steiner连通 k 核查询处理
• Topological sorting of large networks
• An Algorithm for Subgraph Isomorphism