{"id":"https://openalex.org/W4390547999","doi":"https://doi.org/10.1145/3632410.3632459","title":"VeNoM: Approximate Subgraph Matching with Enhanced Neighbourhood Structural Information","display_name":"VeNoM: Approximate Subgraph Matching with Enhanced Neighbourhood Structural Information","publication_year":2024,"publication_date":"2024-01-03","ids":{"openalex":"https://openalex.org/W4390547999","doi":"https://doi.org/10.1145/3632410.3632459"},"language":"en","primary_location":{"id":"doi:10.1145/3632410.3632459","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3632410.3632459","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th Joint International Conference on Data Science & Management of Data (11th ACM IKDD CODS and 29th COMAD)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026866119","display_name":"Shubhangi Agarwal","orcid":"https://orcid.org/0009-0004-4405-4833"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Shubhangi Agarwal","raw_affiliation_strings":["Computer Science and Engineering, Indian Institute of Technology Kanpur, India"],"raw_orcid":"https://orcid.org/0009-0004-4405-4833","affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, Indian Institute of Technology Kanpur, India","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053023517","display_name":"Sourav Dutta","orcid":"https://orcid.org/0000-0002-8934-9166"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sourav Dutta","raw_affiliation_strings":["Huawei Research, Ireland"],"raw_orcid":"https://orcid.org/0000-0002-8934-9166","affiliations":[{"raw_affiliation_string":"Huawei Research, Ireland","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103014125","display_name":"Arnab Bhattacharya","orcid":"https://orcid.org/0000-0001-7331-0788"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Arnab Bhattacharya","raw_affiliation_strings":["Computer Science and Engineering, Indian Institute of Technology Kanpur, India"],"raw_orcid":"https://orcid.org/0000-0001-7331-0788","affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, Indian Institute of Technology Kanpur, India","institution_ids":["https://openalex.org/I94234084"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5026866119"],"corresponding_institution_ids":["https://openalex.org/I94234084"],"apc_list":null,"apc_paid":null,"fwci":0.2381,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.44136963,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"18","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.6698933243751526},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6459848880767822},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.566609263420105},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.5363423228263855},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4577885866165161},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44780078530311584},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.42016923427581787},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38901689648628235},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32943427562713623},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3271680474281311},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.232264906167984},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10932061076164246}],"concepts":[{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.6698933243751526},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6459848880767822},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.566609263420105},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.5363423228263855},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4577885866165161},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44780078530311584},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.42016923427581787},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38901689648628235},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32943427562713623},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3271680474281311},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.232264906167984},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10932061076164246},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3632410.3632459","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3632410.3632459","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th Joint International Conference on Data Science & Management of Data (11th ACM IKDD CODS and 29th COMAD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.8600000143051147,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1509240356","https://openalex.org/W1946039914","https://openalex.org/W1972243925","https://openalex.org/W1975068437","https://openalex.org/W2013497015","https://openalex.org/W2027420911","https://openalex.org/W2035173902","https://openalex.org/W2036265926","https://openalex.org/W2069543418","https://openalex.org/W2071333487","https://openalex.org/W2100080493","https://openalex.org/W2101511590","https://openalex.org/W2102913801","https://openalex.org/W2124637492","https://openalex.org/W2131792733","https://openalex.org/W2143363350","https://openalex.org/W2147913014","https://openalex.org/W2241555812","https://openalex.org/W2254833717","https://openalex.org/W2294347342","https://openalex.org/W2345132433","https://openalex.org/W2423652555","https://openalex.org/W2464477051","https://openalex.org/W2604109958","https://openalex.org/W2766317792","https://openalex.org/W2773901060","https://openalex.org/W2898087046","https://openalex.org/W2948359422","https://openalex.org/W3175298242","https://openalex.org/W3195185452","https://openalex.org/W3208942821","https://openalex.org/W6773915836"],"related_works":["https://openalex.org/W1512756268","https://openalex.org/W2902222102","https://openalex.org/W2393701947","https://openalex.org/W2886672068","https://openalex.org/W1887488684","https://openalex.org/W2953496651","https://openalex.org/W2532922352","https://openalex.org/W1739013558","https://openalex.org/W167435155","https://openalex.org/W3208942821"],"abstract_inverted_index":{"Subgraph":[0],"matching":[1,37],"is":[2,187],"an":[3,31,67],"important":[4],"research":[5],"problem":[6],"in":[7,21],"the":[8,14,63,71,78,102,107,112,133,151,158,174],"area":[9],"of":[10,66,75,88,98,106,114,153,160,173],"graph":[11,120],"mining.":[12],"Over":[13],"years,":[15],"researchers":[16],"have":[17,42],"made":[18],"significant":[19],"headway":[20],"this":[22,81],"direction":[23],"with":[24],"many":[25,40],"state-of-the-art":[26,90],"algorithms":[27],"aimed":[28],"at":[29],"providing":[30],"efficient":[32],"solution":[33],"for":[34,176],"approximate":[35],"subgraph":[36],"(ASM).":[38],"Although":[39],"studies":[41],"been":[43,58],"conducted":[44],"to":[45],"compare":[46,132],"these":[47,115],"and":[48,53,73,94,104,118],"highlight":[49],"their":[50],"respective":[51],"advantages":[52],"differences,":[54],"little":[55],"analysis":[56],"has":[57],"done":[59],"on":[60,122],"how":[61],"varying":[62],"different":[64,96],"aspects":[65],"ASM":[68,91,143,161],"approach":[69],"including":[70],"depth":[72,105,152],"breadth":[74,103,172],"neighborhood":[76,108,116,140,155,175],"affect":[77],"performance.":[79],"In":[80],"paper,":[82],"we":[83],"propose":[84],"VeNoM,":[85],"a":[86,89,138,154,166,177,190],"variant":[87],"algorithm":[92],"VELSET,":[93],"present":[95],"extensions":[97],"it":[99,164,186],"by":[100],"parameterizing":[101],"considered.":[109],"We":[110,130],"discuss":[111],"effects":[113],"parameters":[117,121],"other":[119],"performance":[123],"through":[124],"empirical":[125,146],"results":[126,147],"over":[127],"diverse":[128],"datasets.":[129],"also":[131],"VeNoM":[134],"instances":[135],"against":[136],"VerSaChI,":[137],"two-hop":[139],"similarity":[141],"based":[142],"approach.":[144],"The":[145,171],"suggest":[148],"that":[149],"increasing":[150],"can":[156],"increase":[157],"accuracy":[159],"significantly,":[162],"although":[163],"requires":[165],"much":[167,182],"longer":[168],"running":[169],"time.":[170],"vertex":[178],"does":[179],"not":[180],"matter":[181],"as":[183,185],"long":[184],"more":[188],"than":[189],"single":[191],"edge.":[192]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}