Tps: A new way to find good vertex-search order for exact subgraph matching

Exact subgraph matching is fundamental to numerous graph data applications. The inherent NP-completeness of subgraph isomorphism poses significant challenges in developing efficient matching algorithms. Current methods show limited success, particularly in their filtering and verification stages. Se...

Full description

Saved in:

Bibliographic Details
Published in:	Multimedia tools and applications Vol. 83; no. 27; pp. 69875 - 69896
Main Authors:	Ma, Yixing, Xu, Baomin, Yin, Hongfeng
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.08.2024 Springer Nature B.V
Subjects:	Algorithms Computer Communication Networks Computer Science Data Structures and Information Theory Effectiveness Efficiency Graph matching Graph representations Graph theory Information technology Isomorphism Multimedia Multimedia Information Systems Optimization Search algorithms Semantic web Special Purpose and Application-Based Systems Subgraph query Exact subgraph matching Query processing Optimization
ISSN:	1573-7721, 1380-7501, 1573-7721
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!