{"id":"https://openalex.org/W3116183289","doi":"https://doi.org/10.1109/hpec43674.2020.9286191","title":"Leveraging Linear Algebra to Count and Enumerate Simple Subgraphs","display_name":"Leveraging Linear Algebra to Count and Enumerate Simple Subgraphs","publication_year":2020,"publication_date":"2020-09-22","ids":{"openalex":"https://openalex.org/W3116183289","doi":"https://doi.org/10.1109/hpec43674.2020.9286191","mag":"3116183289"},"language":"en","primary_location":{"id":"doi:10.1109/hpec43674.2020.9286191","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec43674.2020.9286191","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE High Performance Extreme Computing Conference (HPEC)","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/A5054533384","display_name":"Vitaliy Gleyzer","orcid":"https://orcid.org/0000-0002-2618-005X"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]},{"id":"https://openalex.org/I4210122954","display_name":"MIT Lincoln Laboratory","ror":"https://ror.org/022z6jk58","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Vitaliy Gleyzer","raw_affiliation_strings":["Massachusetts Institute of Technology Lincoln Laboratory, Lexington, MA, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology Lincoln Laboratory, Lexington, MA, USA","institution_ids":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071356272","display_name":"Andrew J. Soszynski","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]},{"id":"https://openalex.org/I4210122954","display_name":"MIT Lincoln Laboratory","ror":"https://ror.org/022z6jk58","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew J. Soszynski","raw_affiliation_strings":["Massachusetts Institute of Technology Lincoln Laboratory, Lexington, MA, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology Lincoln Laboratory, Lexington, MA, USA","institution_ids":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085426788","display_name":"Edward K. Kao","orcid":"https://orcid.org/0000-0001-8880-0691"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]},{"id":"https://openalex.org/I4210122954","display_name":"MIT Lincoln Laboratory","ror":"https://ror.org/022z6jk58","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Edward K. Kao","raw_affiliation_strings":["Massachusetts Institute of Technology Lincoln Laboratory, Lexington, MA, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology Lincoln Laboratory, Lexington, MA, USA","institution_ids":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5054533384"],"corresponding_institution_ids":["https://openalex.org/I4210122954","https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.4885,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.66996034,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9990000128746033,"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.9990000128746033,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9976999759674072,"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"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9945999979972839,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-algebra","display_name":"Linear algebra","score":0.7008658051490784},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.608116865158081},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.5738852620124817},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.5169474482536316},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4982621669769287},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.48896467685699463},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.43712693452835083},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43561404943466187},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4220961034297943},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.42154577374458313},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.4107147455215454},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3683302402496338},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2977305054664612},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2482597827911377},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12244981527328491}],"concepts":[{"id":"https://openalex.org/C139352143","wikidata":"https://www.wikidata.org/wiki/Q82571","display_name":"Linear algebra","level":2,"score":0.7008658051490784},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.608116865158081},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.5738852620124817},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.5169474482536316},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4982621669769287},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.48896467685699463},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.43712693452835083},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43561404943466187},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4220961034297943},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.42154577374458313},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.4107147455215454},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3683302402496338},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2977305054664612},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2482597827911377},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12244981527328491},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpec43674.2020.9286191","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec43674.2020.9286191","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W26556108","https://openalex.org/W1553420678","https://openalex.org/W1599969036","https://openalex.org/W1665157575","https://openalex.org/W1995213405","https://openalex.org/W2046973707","https://openalex.org/W2061425021","https://openalex.org/W2086236971","https://openalex.org/W2100586946","https://openalex.org/W2119998616","https://openalex.org/W2126359798","https://openalex.org/W2147405597","https://openalex.org/W2153622112","https://openalex.org/W2294347342","https://openalex.org/W2505207871","https://openalex.org/W2528271650","https://openalex.org/W2755088640","https://openalex.org/W2765934619","https://openalex.org/W2795398503","https://openalex.org/W2902294729","https://openalex.org/W2902887439","https://openalex.org/W2903237845","https://openalex.org/W2965423625","https://openalex.org/W2995872593","https://openalex.org/W3012738226","https://openalex.org/W3106524413","https://openalex.org/W3115010993","https://openalex.org/W4288294444","https://openalex.org/W6662493225","https://openalex.org/W6749863735"],"related_works":["https://openalex.org/W2532922352","https://openalex.org/W231720905","https://openalex.org/W2604893261","https://openalex.org/W2915540008","https://openalex.org/W1482551403","https://openalex.org/W2361654510","https://openalex.org/W2128390795","https://openalex.org/W2604114816","https://openalex.org/W2954463587","https://openalex.org/W2393701947"],"abstract_inverted_index":{"Even":[0],"though":[1],"subgraph":[2,5,111,172],"counting":[3,112],"and":[4,19,57,85,94,102,113,164],"matching":[6,114,173],"are":[7,12],"well-known":[8],"NP-Hard":[9],"problems,":[10],"they":[11],"foundational":[13],"building":[14],"blocks":[15],"for":[16,46,108,115,131],"many":[17],"scientific":[18],"commercial":[20],"applications.":[21],"In":[22,97],"order":[23],"to":[24,30,69,88,151,155,170],"analyze":[25],"graphs":[26],"that":[27,140],"contain":[28],"millions":[29],"billions":[31],"of":[32,60],"edges,":[33],"distributed":[34],"systems":[35],"can":[36,126],"provide":[37],"computational":[38],"scalability":[39],"through":[40,52],"search":[41,162],"parallelization.":[42],"One":[43],"recent":[44],"approach":[45,76],"exposing":[47],"graph":[48,73],"algorithm":[49],"parallelization":[50],"is":[51,67],"a":[53,70,82,104,132],"linear":[54,91,105,142],"algebra":[55,92,106,143],"formulation":[56,144],"the":[58,61,119,141,161,166],"use":[59],"matrix":[62],"multiply":[63],"operation,":[64],"which":[65,148],"conceptually":[66],"equivalent":[68],"massively":[71],"parallel":[72],"traversal.":[74],"This":[75],"has":[77],"several":[78],"benefits,":[79],"including":[80],"1)":[81],"mathematically-rigorous":[83],"foundation,":[84],"2)":[86],"ability":[87],"leverage":[89],"specialized":[90],"accelerators":[93],"high-performance":[95],"libraries.":[96],"this":[98],"paper":[99],"we":[100,138],"explore":[101],"define":[103],"methodology":[107],"performing":[109],"exact":[110],"4-vertex":[116],"subgraphs":[117,125],"excluding":[118],"clique.":[120],"Matches":[121],"on":[122],"these":[123],"simple":[124],"be":[127,152],"joined":[128],"as":[129,168],"components":[130],"larger":[133],"subgraph.":[134],"With":[135],"thorough":[136],"analysis":[137],"demonstrate":[139],"leverages":[145],"path":[146],"aggregation":[147],"allows":[149],"it":[150],"up":[153],"2\u00d7":[154],"5\u00d7":[156],"more":[157],"efficient":[158],"in":[159],"traversing":[160],"space":[163],"compressing":[165],"results":[167],"compared":[169],"tree-based":[171],"techniques.":[174]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}