{"id":"https://openalex.org/W2932462908","doi":"https://doi.org/10.1109/access.2019.2908930","title":"Impact Vertices-Aware Diffusion Walk Algorithm for Efficient Subgraph Pattern Matching in Massive Graphs","display_name":"Impact Vertices-Aware Diffusion Walk Algorithm for Efficient Subgraph Pattern Matching in Massive Graphs","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2932462908","doi":"https://doi.org/10.1109/access.2019.2908930","mag":"2932462908"},"language":"en","primary_location":{"id":"doi:10.1109/access.2019.2908930","is_oa":true,"landing_page_url":"http://doi.org/10.1109/access.2019.2908930","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8600701/08679957.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://ieeexplore.ieee.org/ielx7/6287639/8600701/08679957.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089830603","display_name":"Lihua Ai","orcid":"https://orcid.org/0000-0001-5864-2186"},"institutions":[{"id":"https://openalex.org/I21193070","display_name":"Beijing Jiaotong University","ror":"https://ror.org/01yj56c84","country_code":"CN","type":"education","lineage":["https://openalex.org/I21193070"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Lihua Ai","raw_affiliation_strings":["Beijing Key Laboratory of Traffic Data Analysis and Mining, Beijing Jiaotong University, Beijing 100044, China"],"affiliations":[{"raw_affiliation_string":"Beijing Key Laboratory of Traffic Data Analysis and Mining, Beijing Jiaotong University, Beijing 100044, China","institution_ids":["https://openalex.org/I21193070"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082188602","display_name":"Lakshmish Ramaswamy","orcid":"https://orcid.org/0000-0002-4567-4186"},"institutions":[{"id":"https://openalex.org/I165733156","display_name":"University of Georgia","ror":"https://ror.org/00te3t702","country_code":"US","type":"education","lineage":["https://openalex.org/I165733156"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lakshmish Ramaswamy","raw_affiliation_strings":["Department of Computer Science, University of Georgia, Athens, GA 30602, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Georgia, Athens, GA 30602, USA","institution_ids":["https://openalex.org/I165733156"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103202119","display_name":"Siwei Luo","orcid":"https://orcid.org/0009-0007-8120-7343"},"institutions":[{"id":"https://openalex.org/I21193070","display_name":"Beijing Jiaotong University","ror":"https://ror.org/01yj56c84","country_code":"CN","type":"education","lineage":["https://openalex.org/I21193070"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Siwei Luo","raw_affiliation_strings":["Beijing Key Laboratory of Traffic Data Analysis and Mining, Beijing Jiaotong University, Beijing 100044, China"],"affiliations":[{"raw_affiliation_string":"Beijing Key Laboratory of Traffic Data Analysis and Mining, Beijing Jiaotong University, Beijing 100044, China","institution_ids":["https://openalex.org/I21193070"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089830603"],"corresponding_institution_ids":["https://openalex.org/I21193070"],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.1012,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.40602837,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"7","issue":null,"first_page":"44555","last_page":"44561"},"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.9962999820709229,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9898999929428101,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.6892293691635132},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.6473894715309143},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.626442015171051},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.5898049473762512},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5138945579528809},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.49940037727355957},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4914642572402954},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45815977454185486},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.45192950963974},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.4231984615325928},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37246352434158325},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.35604074597358704},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.336932897567749},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30726727843284607},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.23279336094856262},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12638449668884277}],"concepts":[{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.6892293691635132},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.6473894715309143},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.626442015171051},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.5898049473762512},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5138945579528809},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.49940037727355957},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4914642572402954},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45815977454185486},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.45192950963974},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.4231984615325928},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37246352434158325},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.35604074597358704},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.336932897567749},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30726727843284607},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.23279336094856262},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12638449668884277},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2019.2908930","is_oa":true,"landing_page_url":"http://doi.org/10.1109/access.2019.2908930","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8600701/08679957.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:5cba19adf9da4f939e62b1e9b5fde37d","is_oa":true,"landing_page_url":"https://doaj.org/article/5cba19adf9da4f939e62b1e9b5fde37d","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 7, Pp 44555-44561 (2019)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2019.2908930","is_oa":true,"landing_page_url":"http://doi.org/10.1109/access.2019.2908930","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8600701/08679957.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.6299999952316284}],"awards":[{"id":"https://openalex.org/G7024556094","display_name":null,"funder_award_id":"356072535","funder_id":"https://openalex.org/F4320323066","funder_display_name":"Beijing Jiaotong University"}],"funders":[{"id":"https://openalex.org/F4320323066","display_name":"Beijing Jiaotong University","ror":"https://ror.org/01yj56c84"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2932462908.pdf","grobid_xml":"https://content.openalex.org/works/W2932462908.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1522399527","https://openalex.org/W1558062699","https://openalex.org/W1969970763","https://openalex.org/W1979331609","https://openalex.org/W2013973777","https://openalex.org/W2045271686","https://openalex.org/W2045426033","https://openalex.org/W2082773934","https://openalex.org/W2086198191","https://openalex.org/W2094827065","https://openalex.org/W2098817244","https://openalex.org/W2120593471","https://openalex.org/W2126359798","https://openalex.org/W2146162554","https://openalex.org/W2147405597","https://openalex.org/W2152358193","https://openalex.org/W2154878346","https://openalex.org/W2164570631","https://openalex.org/W2496505408","https://openalex.org/W2608355501","https://openalex.org/W6653790936"],"related_works":["https://openalex.org/W2393701947","https://openalex.org/W2953496651","https://openalex.org/W167435155","https://openalex.org/W2376177032","https://openalex.org/W18223240","https://openalex.org/W2052731309","https://openalex.org/W4301586380","https://openalex.org/W2766774524","https://openalex.org/W4245682093","https://openalex.org/W1974819867"],"abstract_inverted_index":{"Subgraph":[0],"pattern":[1,15,65,111],"matching":[2,16,112],"is":[3],"a":[4,40,51,58,75,89,139],"basic":[5],"building":[6],"block":[7],"for":[8,63],"many":[9],"applications.":[10],"Where":[11],"to":[12,20,78,87],"commence":[13],"the":[14,33,70,80,115],"task":[17],"and":[18,43,84,104,152],"how":[19],"proceed":[21],"are":[22],"fundamental":[23],"issues":[24],"in":[25,37,149],"massive":[26],"graphs.":[27],"In":[28],"this":[29],"paper,":[30],"we":[31],"propose":[32],"most":[34,71,116],"impact":[35,53,72,117],"vertices":[36,73,118],"view":[38],"of":[39,141],"query":[41,76],"graph":[42,77,92,110,134],"diffusion":[44,55,94,130],"walk":[45,56,131],"on":[46,101],"data":[47,91],"graph.":[48],"We":[49,96,136],"present":[50],"novel":[52],"vertices-aware":[54],"algorithm,":[57],"distributed":[59],"algorithm":[60,68,146],"named":[61],"DiffWalk,":[62],"subgraph":[64],"matching.":[66],"Our":[67],"employs":[69],"from":[74],"locate":[79],"initial":[81],"search":[82],"position":[83],"then":[85],"proceeds":[86],"traverse":[88,133],"large-scale":[90],"by":[93,123],"walk.":[95],"give":[97],"theoretical":[98],"analyses":[99],"based":[100],"probability":[102],"inference":[103],"spectral":[105],"graph,":[106],"which":[107],"prove":[108,128],"that":[109,129,143],"beginning":[113],"at":[114],"could":[119,132],"prevent":[120],"comparison":[121],"overhead":[122],"low-probability":[124],"events":[125],"first,":[126],"also":[127],"efficiently.":[135],"have":[137],"performed":[138],"range":[140],"experiments":[142],"demonstrate":[144],"our":[145],"efficiency":[147],"both":[148],"running":[150],"time":[151],"communication":[153],"size.":[154]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}