{"id":"https://openalex.org/W3086833716","doi":"https://doi.org/10.1109/hpcs48598.2019.9188143","title":"Introducing Streaming into Linear Algebra-based Sparse Graph Algorithms","display_name":"Introducing Streaming into Linear Algebra-based Sparse Graph Algorithms","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W3086833716","doi":"https://doi.org/10.1109/hpcs48598.2019.9188143","mag":"3086833716"},"language":"en","primary_location":{"id":"doi:10.1109/hpcs48598.2019.9188143","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcs48598.2019.9188143","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Conference on High Performance Computing & Simulation (HPCS)","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/A5029212199","display_name":"Peter M. Kogge","orcid":"https://orcid.org/0000-0002-3329-547X"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Peter M. Kogge","raw_affiliation_strings":["Dept. of Computer Science and Engr., Univ. of Notre Dame, Notre Dame, IN, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engr., Univ. of Notre Dame, Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001710509","display_name":"Neil Butcher","orcid":null},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Neil A. Butcher","raw_affiliation_strings":["Dept. of Computer Science and Engr., Univ. of Notre Dame, Notre Dame, IN, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engr., Univ. of Notre Dame, Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090370401","display_name":"Brian A. Page","orcid":"https://orcid.org/0000-0001-5563-9678"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brian A. Page","raw_affiliation_strings":["Dept. of Computer Science and Engr., Univ. of Notre Dame, Notre Dame, IN, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engr., Univ. of Notre Dame, Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5029212199"],"corresponding_institution_ids":["https://openalex.org/I107639228"],"apc_list":null,"apc_paid":null,"fwci":0.4049,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.67351926,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"abs 1610 7902","issue":null,"first_page":"486","last_page":"495"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T11106","display_name":"Data Management and Algorithms","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9962000250816345,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-algebra","display_name":"Linear algebra","score":0.7136505246162415},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6966143846511841},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4644612669944763},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46037206053733826},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42582884430885315},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2310686707496643}],"concepts":[{"id":"https://openalex.org/C139352143","wikidata":"https://www.wikidata.org/wiki/Q82571","display_name":"Linear algebra","level":2,"score":0.7136505246162415},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6966143846511841},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4644612669944763},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46037206053733826},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42582884430885315},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2310686707496643},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcs48598.2019.9188143","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcs48598.2019.9188143","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Conference on High Performance Computing & Simulation (HPCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W26556108","https://openalex.org/W2002576896","https://openalex.org/W2016289973","https://openalex.org/W2017306136","https://openalex.org/W2020580827","https://openalex.org/W2083116175","https://openalex.org/W2102322109","https://openalex.org/W2165753192","https://openalex.org/W2461193710","https://openalex.org/W2501699529","https://openalex.org/W2542072367","https://openalex.org/W2765934619","https://openalex.org/W2767203711","https://openalex.org/W2903237845","https://openalex.org/W3098650335","https://openalex.org/W4206667141","https://openalex.org/W4252345548","https://openalex.org/W4253426709","https://openalex.org/W6728876711"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W2350741829"],"abstract_inverted_index":{"GraphBLAS":[0],"is":[1,57],"a":[2,8,43,46],"new":[3],"package":[4],"designed":[5],"to":[6,39,59],"provide":[7],"standard":[9],"set":[10],"of":[11,22,30],"building":[12],"blocks":[13],"for":[14],"graph":[15],"algorithms":[16],"based":[17],"formally":[18],"in":[19],"the":[20,31],"language":[21],"linear":[23],"algebra.":[24],"This":[25],"paper":[26],"suggests":[27],"some":[28],"extensions":[29],"underlying":[32],"math":[33],"that":[34],"would":[35],"enhance":[36],"GraphBLAS'":[37],"ability":[38],"stream":[40],"updates":[41],"into":[42],"computation":[44],"without":[45],"bulk":[47],"recomputation,":[48],"and":[49],"at":[50],"greatly":[51],"reduced":[52],"computational":[53],"complexity.":[54],"The":[55],"process":[56],"applied":[58],"several":[60],"examples.":[61]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}