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!

Abstract	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.
AbstractList	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.
Author	Xu, Baomin Ma, Yixing Yin, Hongfeng
Author_xml	– sequence: 1 givenname: Yixing orcidid: 0009-0006-4552-1389 surname: Ma fullname: Ma, Yixing email: yxgma@ucdavis.edu organization: College of Letters and Science, University of California, School of Computer and Information Technology, Beijing Jiaotong University – sequence: 2 givenname: Baomin surname: Xu fullname: Xu, Baomin organization: School of Computer and Information Technology, Beijing Jiaotong University – sequence: 3 givenname: Hongfeng surname: Yin fullname: Yin, Hongfeng email: hfyin@czjtu.edu.cn organization: School of Computer and Information Technology, Cangzhou Jiaotong College
BookMark	eNp9kMtOwzAQRS1UJNrCD7CyxDrgV-KEXVXxEkhsytryK2mq1g62S9u_JxAkEIuuZhb3zB2dCRg57ywAlxhdY4T4TcQYMZIhwjJcUlJm9ASMcc5pxjnBoz_7GZjEuEIIFzlhY_C86OItnEFnd3AnDzB5WLfOwMZ7Az9sSHafRSuDXkIfjA2w9gHavdQJxq1qguyWcCOTXrauOQentVxHe_Ezp-Dt_m4xf8xeXh-e5rOXTFNcpYwXNjeFUoxxxXBNUGVMXhpacIRqpbHVlNBK5bJWknNVcEIt1dpUeWktKzWdgqvhbhf8-9bGJFZ-G1xfKSgqWc4JZ7xPkSGlg48x2Fp0od3IcBAYiS9pYpAmemniW5qgPVT-g3SbZGq9S0G26-MoHdDY97jGht-vjlCfwbGCdw
CitedBy_id	crossref_primary_10_1016_j_patcog_2025_112044
Cites_doi	10.1007/s10115-022-01753-x 10.1142/S0218001414500013 10.1007/s00778-022-00749-x 10.1109/TVCG.2007.70405 10.1016/j.bdr.2022.100350 10.1371/journal.pone.0097896 10.1093/bioinformatics/bti1054 10.1016/j.jocs.2016.03.017 10.1109/ICDE53745.2022.00023 10.1109/SCIS.2007.367670 10.1007/s00778-023-00781-5 10.1007/978-3-319-26190-4_8 10.1109/BigData.2016.7840996 10.1109/BigData52589.2021.9671760 10.1145/3448016.3457265 10.1142/S0217984913500553 10.1142/S0218001415500251 10.1109/TKDE.2007.190746 10.1145/1247480.1247574 10.1145/1989323.1989418
ContentType	Journal Article
Copyright	The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
Copyright_xml	– notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
DBID	AAYXX CITATION 3V. 7SC 7WY 7WZ 7XB 87Z 8AL 8AO 8FD 8FE 8FG 8FK 8FL 8G5 ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG F~G GNUQQ GUQSH HCIFZ JQ2 K60 K6~ K7- L.- L7M L~C L~D M0C M0N M2O MBDVC P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI Q9U
DOI	10.1007/s11042-024-18328-3
DatabaseName	CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) Research Library (Alumni) ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest SciTech Premium Collection Technology Collection Advanced Technologies & Aerospace Collection ProQuest Central Essentials - QC ProQuest Central Business Premium Collection Technology Collection ProQuest One ProQuest Central Korea Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student ProQuest Research Library SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ABI/INFORM Professional Advanced Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global Computing Database ProQuest Research Library Research Library (Corporate) Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central Basic
DatabaseTitle	CrossRef ABI/INFORM Global (Corporate) ProQuest Business Collection (Alumni Edition) ProQuest One Business Research Library Prep Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College Research Library (Alumni Edition) ProQuest Pharma Collection ABI/INFORM Complete ProQuest Central ABI/INFORM Professional Advanced ProQuest One Applied & Life Sciences ProQuest Central Korea ProQuest Research Library ProQuest Central (New) Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection ProQuest Business Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition ProQuest One Business (Alumni) ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) Business Premium Collection (Alumni)
DatabaseTitleList	ABI/INFORM Global (Corporate)
Database_xml	– sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science
EISSN	1573-7721
EndPage	69896
ExternalDocumentID	10_1007_s11042_024_18328_3
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C .4S .86 .DC .VR 06D 0R~ 0VY 123 1N0 1SB 2.D 203 28- 29M 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 3EH 3V. 4.4 406 408 409 40D 40E 5QI 5VS 67Z 6NX 7WY 8AO 8FE 8FG 8FL 8G5 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFO ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACREN ACSNA ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADMLS ADRFC ADTPH ADURQ ADYFF ADYOE ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFYQB AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMTXH AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN AZQEC B-. BA0 BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 DWQXO EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GUQSH GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I-F I09 IHE IJ- IKXTQ ITG ITH ITM IWAJR IXC IXE IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K60 K6V K6~ K7- KDC KOV KOW LAK LLZTM M0C M0N M2O M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P62 P9O PF0 PQBIZ PQBZA PQQKQ PROAC PT4 PT5 Q2X QOK QOS R4E R89 R9I RHV RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TH9 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7R Z7S Z7W Z7X Z7Y Z7Z Z81 Z83 Z86 Z88 Z8M Z8N Z8Q Z8R Z8S Z8T Z8U Z8W Z92 ZMTXR ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADKFA AEZWR AFDZB AFFHD AFHIU AFOHR AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L.- L7M L~C L~D MBDVC PKEHL PQEST PQUKI Q9U
ID	FETCH-LOGICAL-c319t-76e5d6bb447b41f209dd58d36700fbc1ec3239b5afba77b6723e3ccd958ee48c3
IEDL.DBID	P5Z
ISICitedReferencesCount	1
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001153891700002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1573-7721 1380-7501
IngestDate	Wed Nov 05 08:26:20 EST 2025 Sat Nov 29 06:20:44 EST 2025 Tue Nov 18 21:43:05 EST 2025 Fri Feb 21 02:39:40 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	27
Keywords	Subgraph query Exact subgraph matching Query processing Optimization
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c319t-76e5d6bb447b41f209dd58d36700fbc1ec3239b5afba77b6723e3ccd958ee48c3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0009-0006-4552-1389
PQID	3084572747
PQPubID	54626
PageCount	22
ParticipantIDs	proquest_journals_3084572747 crossref_primary_10_1007_s11042_024_18328_3 crossref_citationtrail_10_1007_s11042_024_18328_3 springer_journals_10_1007_s11042_024_18328_3
PublicationCentury	2000
PublicationDate	20240800
PublicationDateYYYYMMDD	2024-08-01
PublicationDate_xml	– month: 8 year: 2024 text: 20240800
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York – name: Dordrecht
PublicationSubtitle	An International Journal
PublicationTitle	Multimedia tools and applications
PublicationTitleAbbrev	Multimed Tools Appl
PublicationYear	2024
Publisher	Springer US Springer Nature B.V
Publisher_xml	– name: Springer US – name: Springer Nature B.V
References	Zhang, Bai, Lian, Wen (CR26) 2022; 30 Kim, Choi, Park, Lin, Hong, Han (CR21) 2023; 32 Liu, Baomin, Xiang, Xin (CR19) 2016; 16 CR18 CR17 CR16 CR15 CR13 CR12 CR11 CR10 CR2 CR4 Foggia, Percannella, Vento (CR20) 2014; 28 CR6 CR8 CR7 Coming, Staadt (CR5) 2008; 14 CR9 Houbraken (CR3) 2013; 9 CR25 CR24 CR23 Wang, Zhang, Guo, Zhao (CR22) 2023; 65 Gandon (CR1) 2018; 23 Nabieva, Jim, Agarwal (CR14) 2005; 21 18328_CR15 18328_CR16 18328_CR17 18328_CR18 H Kim (18328_CR21) 2023; 32 H Zhang (18328_CR26) 2022; 30 DS Coming (18328_CR5) 2008; 14 18328_CR8 18328_CR9 18328_CR4 J Liu (18328_CR19) 2016; 16 18328_CR6 18328_CR7 18328_CR23 18328_CR2 18328_CR24 18328_CR25 X Wang (18328_CR22) 2023; 65 F Gandon (18328_CR1) 2018; 23 E Nabieva (18328_CR14) 2005; 21 Maarten Houbraken (18328_CR3) 2013; 9 P Foggia (18328_CR20) 2014; 28 18328_CR11 18328_CR12 18328_CR13 18328_CR10
References_xml	– ident: CR18 – ident: CR4 – ident: CR2 – ident: CR16 – volume: 65 start-page: 945 issue: 3 year: 2023 end-page: 989 ident: CR22 article-title: A survey of continuous subgraph matching for dynamic graphs publication-title: Knowl Inf Syst doi: 10.1007/s10115-022-01753-x – ident: CR12 – ident: CR10 – volume: 28 start-page: 1450001 issue: 01 year: 2014 ident: CR20 article-title: Graph Matching and Learning in Pattern Recognition in the Last 10 Years publication-title: Int J Pattern Recognit Artif Intell doi: 10.1142/S0218001414500013 – volume: 32 start-page: 343 issue: 2 year: 2023 end-page: 368 ident: CR21 article-title: Fast subgraph query processing and subgraph matching via static and dynamic equivalences publication-title: VLDB J doi: 10.1007/s00778-022-00749-x – ident: CR6 – ident: CR8 – ident: CR25 – ident: CR23 – ident: CR15 – volume: 14 start-page: 1 issue: 1 year: 2008 end-page: 12 ident: CR5 article-title: Velocity-Aligned Discrete Oriented Polytopes for Dynamic Collision Detection publication-title: IEEE Trans Visualization and Computer Graphics doi: 10.1109/TVCG.2007.70405 – ident: CR17 – ident: CR13 – ident: CR11 – ident: CR9 – ident: CR7 – volume: 30 year: 2022 ident: CR26 article-title: A twig-based algorithm for top-k subgraph matching in large-scale graph data publication-title: Big Data Research doi: 10.1016/j.bdr.2022.100350 – volume: 9 start-page: e97896 issue: 5 year: 2013 end-page: e97896 ident: CR3 article-title: The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration publication-title: Plos One doi: 10.1371/journal.pone.0097896 – volume: 21 start-page: i302 issue: suppl 1 year: 2005 end-page: i310 ident: CR14 article-title: Whole-proteome Prediction of Protein Function Via Graph-theoretic Analysis of Interaction Maps publication-title: Bioinformatics doi: 10.1093/bioinformatics/bti1054 – volume: 23 start-page: 11 issue: 3–4 year: 2018 end-page: 56 ident: CR1 article-title: A survey of the first 20 years of research on semantic Web and linked data publication-title: Ingenierie des Systemes d'Information – ident: CR24 – volume: 16 start-page: 43 year: 2016 end-page: 50 ident: CR19 article-title: A Link Prediction Algorithm Based on Label Propagation publication-title: Journal of Computational Science doi: 10.1016/j.jocs.2016.03.017 – ident: 18328_CR24 doi: 10.1109/ICDE53745.2022.00023 – ident: 18328_CR7 doi: 10.1109/SCIS.2007.367670 – ident: 18328_CR25 doi: 10.1007/s00778-023-00781-5 – ident: 18328_CR11 – ident: 18328_CR9 – ident: 18328_CR15 doi: 10.1007/978-3-319-26190-4_8 – ident: 18328_CR6 doi: 10.1109/BigData.2016.7840996 – ident: 18328_CR23 doi: 10.1109/BigData52589.2021.9671760 – ident: 18328_CR13 doi: 10.1145/3448016.3457265 – ident: 18328_CR16 doi: 10.1142/S0217984913500553 – ident: 18328_CR10 doi: 10.1142/S0218001415500251 – ident: 18328_CR12 doi: 10.1109/TKDE.2007.190746 – volume: 16 start-page: 43 year: 2016 ident: 18328_CR19 publication-title: Journal of Computational Science doi: 10.1016/j.jocs.2016.03.017 – volume: 65 start-page: 945 issue: 3 year: 2023 ident: 18328_CR22 publication-title: Knowl Inf Syst doi: 10.1007/s10115-022-01753-x – volume: 21 start-page: i302 issue: suppl 1 year: 2005 ident: 18328_CR14 publication-title: Bioinformatics doi: 10.1093/bioinformatics/bti1054 – volume: 32 start-page: 343 issue: 2 year: 2023 ident: 18328_CR21 publication-title: VLDB J doi: 10.1007/s00778-022-00749-x – volume: 9 start-page: e97896 issue: 5 year: 2013 ident: 18328_CR3 publication-title: Plos One doi: 10.1371/journal.pone.0097896 – ident: 18328_CR8 – ident: 18328_CR17 doi: 10.1145/1247480.1247574 – ident: 18328_CR2 – ident: 18328_CR4 – volume: 30 year: 2022 ident: 18328_CR26 publication-title: Big Data Research doi: 10.1016/j.bdr.2022.100350 – volume: 23 start-page: 11 issue: 3–4 year: 2018 ident: 18328_CR1 publication-title: Ingenierie des Systemes d'Information – ident: 18328_CR18 doi: 10.1145/1989323.1989418 – volume: 14 start-page: 1 issue: 1 year: 2008 ident: 18328_CR5 publication-title: IEEE Trans Visualization and Computer Graphics doi: 10.1109/TVCG.2007.70405 – volume: 28 start-page: 1450001 issue: 01 year: 2014 ident: 18328_CR20 publication-title: Int J Pattern Recognit Artif Intell doi: 10.1142/S0218001414500013
SSID	ssj0016524
Score	2.369735
Snippet	Exact subgraph matching is fundamental to numerous graph data applications. The inherent NP-completeness of subgraph isomorphism poses significant challenges...
SourceID	proquest crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	69875
SubjectTerms	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
SummonAdditionalLinks	– databaseName: SpringerLINK Contemporary 1997-Present dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3PS8MwFH7o9KAHp1NxOiUHbxpom6RJj0McgjAEp-xWmjQRQTbZOp3_vUnWrioq6LlJWt6Pvi-8974HcCq1jUlScawMV5gak2FpeIRVpnUiMpMbZvywCd7vi-EwuSmbwqZVtXuVkvR_6rrZLXStJDamYGeGApNVWGOOR8_d0W_vl7mDmEW0bI_5ft_nEFTjyi-pUB9hes3_fds2bJWIEnUXJrADK3rUgmY1rQGVztuCzQ_Ug7twPbAvQ11kUTV6zd5QMUYufY0exuMcuRnNeo4XXoA8Oyey4BbpeaYKNJ1JT3ONLNj1lZh7cNe7HFxc4XKwAlbW4wrMY83yWEpKuaShiYIkz5nIHZdbYKQKtSIRSSTLjMw4lzGPiCZK5QkTWlOhyD40RuORPgBEA-kY2SixwI_GWgodJ4xmUtCEB5rHbQgrWaeqZB13wy-e0pov2ckutbJLvexS0oaz5Z7nBefGr6s7lQrT0v-mKQkEZdzduNtwXqmsfvzzaYd_W34EG5HTuq8I7ECjmMz0Mayrl-JxOjnxdvkOLl3dWQ priority: 102 providerName: Springer Nature
Title	Tps: A new way to find good vertex-search order for exact subgraph matching
URI	https://link.springer.com/article/10.1007/s11042-024-18328-3 https://www.proquest.com/docview/3084572747
Volume	83
WOSCitedRecordID	wos001153891700002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1573-7721 dateEnd: 20241214 omitProxy: false ssIdentifier: ssj0016524 issn: 1573-7721 databaseCode: 7WY dateStart: 20240101 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1573-7721 dateEnd: 20241214 omitProxy: false ssIdentifier: ssj0016524 issn: 1573-7721 databaseCode: M0C dateStart: 20240101 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Collection customDbUrl: eissn: 1573-7721 dateEnd: 20241214 omitProxy: false ssIdentifier: ssj0016524 issn: 1573-7721 databaseCode: P5Z dateStart: 20240101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database (Proquest) customDbUrl: eissn: 1573-7721 dateEnd: 20241214 omitProxy: false ssIdentifier: ssj0016524 issn: 1573-7721 databaseCode: K7- dateStart: 20240101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1573-7721 dateEnd: 20241214 omitProxy: false ssIdentifier: ssj0016524 issn: 1573-7721 databaseCode: BENPR dateStart: 20240101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Research Library customDbUrl: eissn: 1573-7721 dateEnd: 20241214 omitProxy: false ssIdentifier: ssj0016524 issn: 1573-7721 databaseCode: M2O dateStart: 20240101 isFulltext: true titleUrlDefault: https://search.proquest.com/pqrl providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1573-7721 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0016524 issn: 1573-7721 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS-wwFD74WlwXPq84PoYs3Gm4bZM06UpUFEEcB9_XTWnSRASZqlNf_94kkzoq6MZNoLRNS885OV9zku8DWJPa5iSpOFaGK0yNKbA0PMGq0DoThSkNM15sgnc64vIy64YJt35YVtmMiX6gLivl5sj_kUhQxt0_1ObdPXaqUa66GiQ0RmE8TizWt_7cZVfvVYSUBVFbEWGbGeOwaWawdS52G1NshsLOqQUmnxPTEG1-KZD6vLM3_ds3noGpgDjR1sBFZmFE9-ZgulFzQCG452DyAzXhPByc2seiLWRRN3ouXlFdIVfeRtdVVSKn4axf8CBKkGfvRBb8Iv1SqBr1H6WnwUYWDPuVmn_hbG_3dGcfB-EFrGxE1pinmpWplJRySWOTRFlZMlE6rrfISBVrRRKSSVYYWXAuU54QTZQqMya0pkKRBRjrVT29CIhG0jG2UWKBIU21FDrNGC2koBmPNE9bEDdfPVeBldyJY9zmQz5lZ6ncWir3lspJC9bf77kbcHL8ePVKY548xGc_H9qmBRuNgYenv-9t6efeluFP4nzKrxBcgbH64VGvwoR6qm_6D20Y5Rf_2zC-vdvpHtujA45texjtuDY5anvvte3xyfkb7w3vyA
linkProvider	ProQuest
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3LTtwwFL3iJdEuylud8qgXsGotktiJnQWqEAWBBgYWg8QuxM51VQlNpkwo8FN8I7aTMBQJdiy6jmPJ8fF95PqeA7Cp0PokpQXVRmjKjcmpMiKiOkdMZW4KExsvNiF6PXlxkZ5NwEPbC-OuVbY20RvqotTuH_k2CySPhcuhfgz_UKca5aqrrYRGDYsu3t_alG20c_TT7u9WFB3s9_cOaaMqQLWFW0VFgnGRKMW5UDw0UZAWRSwLR2QWGKVD1CxiqYpzo3IhVCIihkzrIo0lIpea2XknYdrx6rlk7yQ6fapaJHEjoisDaj1x2DTp1K16oWuEsR6RukMkKfvXEY6j2xcFWe_nDub-ty80D5-aiJrs1kdgASZwsAhzrVoFaYzXInx8Rr24BN2-XSbZJTarILf5PalK4sr35FdZFsRpVOMdrRdDPDspscE9wbtcV2R0ozzNN7HBvr-Jugzn77LAFZgalAP8DIQHyjHScWYDX56gkpikMc-V5KkIUCQdCNtdznTDuu7EP66yMV-0Q0ZmkZF5ZGSsA9-e3hnWnCNvjl5r4ZA19meUjbHQge8toMaPX5_ty9uzfYXZw_7JcXZ81OuuwofI4dnfhlyDqer6BtdhRv-tfo-uN_zJIHD53kB7BE6YR8A
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1NT9wwEB0BRagc-K66hYIPcAKLJHZi54AQKl2BFi0cQOIWYmdcVao2lA1l96_x62o7CUsrwY0D5ySWnDzPR2bmPYBthdYnKS2oNkJTbkxOlRER1TliKnNTmNh4sQnR78vr6_RiCh7bWRjXVtnaRG-oi1K7f-T7LJA8Fi6H2jdNW8TFcffw9jd1ClKu0trKadQQ6eH4waZvw4PTY_utd6Ko-_3y2wltFAaottCrqEgwLhKlOBeKhyYK0qKIZeFIzQKjdIiaRSxVcW5ULoRKRMSQaV2ksUTkUjO77jR8EK566doGo_OnCkYSN4K6MqDWK4fNwE49the6oRjrHak7UJKyf53iJNL9rzjrfV538T2_rSVYaCJtclQfjWWYwsEKLLYqFqQxaisw_4yScRV6l3bL5IjYbIM85GNSlcSV9cmPsiyI067GEa03QzxrKbFBP8FRrisyvFee_pvYJMB3qK7B1Zts8BPMDMoBfgbCA-WY6jizATFPUElM0pjnSvJUBCiSDoTtF890w8buREF-ZRMeaYeSzKIk8yjJWAd2n565rblIXr17o4VG1tilYTbBRQf2WnBNLr-82pfXV9uCOYuv7Oy031uHj5GDtm-S3ICZ6u4ev8Ks_lP9HN5t-kNC4OatcfYXuI5Qhg
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Tps%3A+A+new+way+to+find+good+vertex-search+order+for+exact+subgraph+matching&rft.jtitle=Multimedia+tools+and+applications&rft.au=Ma%2C+Yixing&rft.au=Xu%2C+Baomin&rft.au=Yin%2C+Hongfeng&rft.date=2024-08-01&rft.pub=Springer+Nature+B.V&rft.issn=1380-7501&rft.eissn=1573-7721&rft.volume=83&rft.issue=27&rft.spage=69875&rft.epage=69896&rft_id=info:doi/10.1007%2Fs11042-024-18328-3&rft.externalDBID=HAS_PDF_LINK
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1573-7721&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1573-7721&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1573-7721&client=summon