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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Multimedia tools and applications Ročník 83; číslo 27; s. 69875 - 69896
Hlavní autoři: Ma, Yixing, Xu, Baomin, Yin, Hongfeng
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.08.2024
Springer Nature B.V
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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. Selecting an optimal vertex-searching order can greatly improve a subgraph searching algorithm's effectiveness, yet a comprehensive theory for this selection is lacking. In this paper, we introduce the Multistage Graph Search Model (MGSM), a novel approach addressing this gap. MGSM provides insights for identifying the most efficient vertex-searching order and offers a systematic framework for evaluating existing algorithms. Using MGSM, we identify two main challenges in optimizing the search order and present a new matching algorithm “Tps” noted for its strategic vertex-searching order. Extensive experiments demonstrate the superior performance of Tps and its effectiveness and soundness in optimizing search orders.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1573-7721
1380-7501
1573-7721
DOI:10.1007/s11042-024-18328-3