{"id":"https://openalex.org/W4385617564","doi":"https://doi.org/10.1016/j.jksuci.2023.101694","title":"Enhanced subgraph matching for large graphs using candidate region-based decomposition and ordering","display_name":"Enhanced subgraph matching for large graphs using candidate region-based decomposition and ordering","alternate_titles":[],"publication_year":2023,"publication_date":"2023-08-07","ids":{"openalex":"https://openalex.org/W4385617564","doi":"https://doi.org/10.1016/j.jksuci.2023.101694"},"language":"en","primary_location":{"id":"doi:10.1016/j.jksuci.2023.101694","doi":"https://doi.org/10.1016/j.jksuci.2023.101694","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.jksuci.2023.101694","pdf_url":null,"source":{"id":"https://openalex.org/S2764955546","display_name":"Journal of King Saud University - Computer and Information Sciences","issn_l":"1319-1578","issn":["1319-1578","2213-1248"],"is_oa":false,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","dongbi-c","jufo-1","norway-1","oarl","poland-100"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of King Saud University - Computer and Information Sciences","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W4385617564"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.jksuci.2023.101694","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029986612","display_name":"Zubair Ali Ansari","orcid":"https://orcid.org/0000-0001-6515-4914","observed_orcids":["https://orcid.org/0000-0001-6515-4914"]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Zubair Ali Ansari","raw_affiliation_strings":["Department of Computer Science & Engineering, Geethanjali College of Engineering and Technology, Telangana, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Geethanjali College of Engineering and Technology, Telangana, India","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083337102","display_name":"Md. Aslam Parwez","orcid":"https://orcid.org/0000-0003-0087-7171","observed_orcids":["https://orcid.org/0000-0003-0087-7171"]},"institutions":[{"id":"https://openalex.org/I19716509","display_name":"Jamia Hamdard","ror":"https://ror.org/03dwxvb85","country_code":"IN","type":"education","lineage":["https://openalex.org/I19716509"]}],"countries":["IN"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Md. Aslam Parwez","raw_affiliation_strings":["Department of Computer Science and Engineering, Jamia Hamdard, New Delhi, Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Jamia Hamdard, New Delhi, Delhi, India","institution_ids":["https://openalex.org/I19716509"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5092603174","display_name":"Irfan Rashid Thoker","orcid":"https://orcid.org/0000-0002-4704-1200","observed_orcids":["https://orcid.org/0000-0002-4704-1200"]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Irfan Rashid Thoker","raw_affiliation_strings":["Lecturer Computer Science, Department of Education, Govt. of Jammu and Kashmir, Srinagar, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lecturer Computer Science, Department of Education, Govt. of Jammu and Kashmir, Srinagar, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020950017","display_name":"Jahiruddin","orcid":"https://orcid.org/0000-0003-3909-9821","observed_orcids":["https://orcid.org/0000-0003-3909-9821"]},"institutions":[{"id":"https://openalex.org/I59475050","display_name":"Jamia Millia Islamia","ror":"https://ror.org/00pnhhv55","country_code":"IN","type":"education","lineage":["https://openalex.org/I59475050"]}],"countries":["IN"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Jahiruddin","raw_affiliation_strings":["Department of Computer Science, Jamia Millia Islamia (A Central University), Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Jamia Millia Islamia (A Central University), Delhi, India","institution_ids":["https://openalex.org/I59475050"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020950017","https://openalex.org/A5029986612","https://openalex.org/A5083337102","https://openalex.org/A5092603174"],"corresponding_institution_ids":["https://openalex.org/I19716509","https://openalex.org/I59475050"],"apc_list":{"value":1350,"currency":"USD","value_usd":1350},"apc_paid":{"value":1350,"currency":"USD","value_usd":1350},"fwci":1.0179,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.71341104,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":92,"max":98},"biblio":{"volume":"35","issue":"8","first_page":"101694","last_page":"101694"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/subgraph-matching","display_name":"subgraph matching","score":0.9890000224113464},{"id":"https://openalex.org/keywords/large-graphs","display_name":"large-scale graphs","score":0.8299999833106995},{"id":"https://openalex.org/keywords/average-path-length","display_name":"average path length","score":0.8220000267028809},{"id":"https://openalex.org/keywords/graph-search","display_name":"graph search","score":0.6629999876022339},{"id":"https://openalex.org/keywords/search-time","display_name":"search time","score":0.5260000228881836}],"concepts":[{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.6403859853744507},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.5400657653808594},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5376732349395752},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.514120876789093},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.49809718132019043},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.464843213558197},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4355802834033966},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.43120384216308594},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40899163484573364},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3863896131515503},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3811091184616089},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3469005525112152},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2378757894039154},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.12773707509040833},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10894083976745605},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/j.jksuci.2023.101694","doi":"https://doi.org/10.1016/j.jksuci.2023.101694","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.jksuci.2023.101694","pdf_url":null,"source":{"id":"https://openalex.org/S2764955546","display_name":"Journal of King Saud University - Computer and Information Sciences","issn_l":"1319-1578","issn":["1319-1578","2213-1248"],"is_oa":false,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","dongbi-c","jufo-1","norway-1","oarl","poland-100"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of King Saud University - Computer and Information Sciences","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:4305da41684d49478a9b71a52c746b12","doi":null,"is_oa":true,"landing_page_url":"https://doaj.org/article/4305da41684d49478a9b71a52c746b12","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of King Saud University: Computer and Information Sciences, Vol 35, Iss 8, Pp 101694- (2023)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1016/j.jksuci.2023.101694","doi":"https://doi.org/10.1016/j.jksuci.2023.101694","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.jksuci.2023.101694","pdf_url":null,"source":{"id":"https://openalex.org/S2764955546","display_name":"Journal of King Saud University - Computer and Information Sciences","issn_l":"1319-1578","issn":["1319-1578","2213-1248"],"is_oa":false,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","dongbi-c","jufo-1","norway-1","oarl","poland-100"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of King Saud University - Computer and Information Sciences","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G4128469398","display_name":null,"funder_award_id":"MEITY-PHD-1426","funder_id":"https://openalex.org/F4320325255","funder_display_name":"Ministry of Electronics and Information technology"}],"funders":[{"id":"https://openalex.org/F4320325255","display_name":"Ministry of Electronics and Information technology","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W229097380","https://openalex.org/W1649819934","https://openalex.org/W2019030165","https://openalex.org/W2035173902","https://openalex.org/W2119528150","https://openalex.org/W2126359798","https://openalex.org/W2140840007","https://openalex.org/W2143363350","https://openalex.org/W2147405597","https://openalex.org/W2163184742","https://openalex.org/W2241555812","https://openalex.org/W2254833717","https://openalex.org/W2423652555","https://openalex.org/W2562053008","https://openalex.org/W2605914492","https://openalex.org/W2608355501","https://openalex.org/W2766317792","https://openalex.org/W2772594351","https://openalex.org/W2795050613","https://openalex.org/W2805674303","https://openalex.org/W2884369484","https://openalex.org/W2898087046","https://openalex.org/W2948359422","https://openalex.org/W2948437140","https://openalex.org/W2962936633","https://openalex.org/W3012207181","https://openalex.org/W3035937838","https://openalex.org/W3109773888","https://openalex.org/W3115843839","https://openalex.org/W3156741084","https://openalex.org/W3173361933","https://openalex.org/W3208942821","https://openalex.org/W4255889623","https://openalex.org/W4281613391","https://openalex.org/W4283311194","https://openalex.org/W4312341398","https://openalex.org/W4313325773","https://openalex.org/W4319661522","https://openalex.org/W4375928198"],"related_works":["https://openalex.org/W4413349893","https://openalex.org/W3173361933","https://openalex.org/W2464477051","https://openalex.org/W4281613391","https://openalex.org/W7134132588","https://openalex.org/W3029446523","https://openalex.org/W4225667285","https://openalex.org/W4407953348","https://openalex.org/W7164028370","https://openalex.org/W3012207181"],"abstract_inverted_index":{"The":[0,207],"subgraph":[1,66,75,125],"matching":[2,67,76],"problem":[3],"associated":[4,50],"with":[5],"large":[6],"graphs":[7],"is":[8,70,133],"an":[9,136],"emerging":[10],"research":[11],"challenge":[12],"in":[13,48,190],"graph":[14,33,47,99],"search":[15,205,217,237],"due":[16],"to":[17,64,234],"the":[18,22,29,44,49,73,91,97,102,106,111,119,124,130,166,170,210,216,232,236,240],"growing":[19],"size":[20],"of":[21,32,43,72,93,96,104,113,123,139,169,176,209,219,239],"web,":[23],"social,":[24],"and":[25,28,61,110,121,149,162,192,204],"metabolic":[26],"graphs,":[27],"wide":[30],"availability":[31],"databases.":[34],"Such":[35],"problems":[36],"involve":[37],"finding":[38],"all":[39],"instances":[40,95],"(aka":[41],"embedding)":[42],"small-sized":[45],"query":[46,98,107],"large-sized":[51],"reference":[52],"graph.":[53],"Many":[54],"state-of-the-art":[55],"algorithms,":[56],"including":[57],"VF3,":[58],"RI,":[59,140],"CFL-Match,":[60],"Glasgow,":[62],"exist":[63],"solve":[65],"problem.":[68],"RI":[69,195],"one":[71],"fastest":[74],"algorithms":[77],"focusing":[78],"mainly":[79],"on":[80,165,178,196,215],"time":[81,218,238],"efficiency":[82,120,191],"performance":[83,87,198],"measures.":[84],"However,":[85],"other":[86],"measures,":[88,200],"such":[89],"as":[90,135],"number":[92,112],"found":[94],"(embedding":[100],"count),":[101],"method":[103],"ordering":[105,230],"graph\u2019s":[108],"vertices,":[109],"recursive":[114],"calls,":[115],"are":[116],"crucial":[117],"for":[118],"effectiveness":[122,193],"matching.":[126],"In":[127],"this":[128],"paper,":[129],"RI+":[131,177,186,220],"algorithm":[132],"proposed":[134,211,241],"enhanced":[137],"version":[138],"which":[141],"has":[142,231],"been":[143,157],"designed":[144],"using":[145],"candidate":[146,153,171,212,228],"region-based":[147],"decomposition":[148],"ordering.":[150],"Three":[151],"novel":[152],"region":[154,213,229],"orderings":[155,214],"have":[156],"introduced,":[158],"namely":[159],"vertex-count,":[160],"density,":[161],"average-path-length,":[163],"based":[164],"structural":[167],"properties":[168],"regions.":[172],"On":[173],"empirical":[174],"analysis":[175],"real-world":[179],"data":[180],"sets,":[181],"it":[182],"was":[183,221],"observed":[184],"that":[185,225],"shows":[187],"significant":[188],"improvement":[189],"over":[194],"both":[197],"evaluation":[199],"namely,":[201],"embedding":[202],"count":[203],"time.":[206],"influence":[208],"also":[222],"analyzed,":[223],"revealing":[224],"a":[226],"suitable":[227],"potential":[233],"improve":[235],"algorithm.":[242]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4385617564","counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2023-08-07T00:00:00"}
