BOOK-CHAPTER

Efficient Subgraph Similarity All-Matching

Gaoping ZhuKe ZhuWenjie ZhangXuemin LinChuan Xiao

Year: 2012 Lecture notes in computer science Pages: 455-469   Publisher: Springer Science+Business Media
Keywords:
Computer science Merge (version control) Subgraph isomorphism problem Graph factorization Factor-critical graph Graph Matching (statistics) Theoretical computer science Induced subgraph isomorphism problem Pruning Data mining Algorithm Line graph Mathematics Information retrieval Graph power Voltage graph

Metrics

0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
21
Refs
0.05
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Graph Theory and Algorithms
Physical Sciences →  Computer Science →  Computer Vision and Pattern Recognition
Advanced Graph Neural Networks
Physical Sciences →  Computer Science →  Artificial Intelligence
Complexity and Algorithms in Graphs
Physical Sciences →  Computer Science →  Computational Theory and Mathematics

Related Documents

JOURNAL ARTICLE

Efficient distributed subgraph similarity matching

Ye YuanGuoren WangJeffery Yu XuLei Chen

Journal:   The VLDB Journal Year: 2015 Vol: 24 (3)Pages: 369-394
JOURNAL ARTICLE

Subgraph similarity maximal all-matching over a large uncertain graph

Yu GuChunpeng GaoLulu WangGe Yu

Journal:   World Wide Web Year: 2015 Vol: 19 (5)Pages: 755-782
JOURNAL ARTICLE

Efficient GPU-Accelerated Subgraph Matching

Xibo SunQiong Luo

Journal:   Proceedings of the ACM on Management of Data Year: 2023 Vol: 1 (2)Pages: 1-26
BOOK-CHAPTER

Efficient Subgraph Matching Using GPUs

Xiaojie LinRui ZhangZeyi WenHongzhi WangJianzhong Qi

Lecture notes in computer science Year: 2014 Pages: 74-85
© 2026 ScienceGate Book Chapters — All rights reserved.