{"id":"https://openalex.org/W2903237845","doi":"https://doi.org/10.1109/hpec.2018.8547538","title":"Graph algorithms via SuiteSparse: GraphBLAS: triangle counting and K-truss","display_name":"Graph algorithms via SuiteSparse: GraphBLAS: triangle counting and K-truss","publication_year":2018,"publication_date":"2018-09-01","ids":{"openalex":"https://openalex.org/W2903237845","doi":"https://doi.org/10.1109/hpec.2018.8547538","mag":"2903237845"},"language":"en","primary_location":{"id":"doi:10.1109/hpec.2018.8547538","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec.2018.8547538","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE High Performance extreme Computing Conference (HPEC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5069178025","display_name":"Timothy A. Davis","orcid":"https://orcid.org/0000-0001-7614-6899"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Timothy A. Davis","raw_affiliation_strings":["Dept. of Computer Science and Engineering, Texas A&M University, College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engineering, Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5069178025"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":2.8141,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.94523027,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9962000250816345,"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.9962000250816345,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/semiring","display_name":"Semiring","score":0.798447847366333},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.7615022659301758},{"id":"https://openalex.org/keywords/truss","display_name":"Truss","score":0.5515824556350708},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.5470120310783386},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4976504147052765},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4589129686355591},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.44731223583221436},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4424896836280823},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4368235468864441},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4114507734775543},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3879104256629944},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3766464293003082}],"concepts":[{"id":"https://openalex.org/C21696900","wikidata":"https://www.wikidata.org/wiki/Q1333055","display_name":"Semiring","level":2,"score":0.798447847366333},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.7615022659301758},{"id":"https://openalex.org/C173534245","wikidata":"https://www.wikidata.org/wiki/Q1328068","display_name":"Truss","level":2,"score":0.5515824556350708},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.5470120310783386},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4976504147052765},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4589129686355591},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44731223583221436},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4424896836280823},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4368235468864441},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4114507734775543},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3879104256629944},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3766464293003082},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpec.2018.8547538","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec.2018.8547538","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 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":7,"referenced_works":["https://openalex.org/W26556108","https://openalex.org/W1665157575","https://openalex.org/W2019724001","https://openalex.org/W2089437293","https://openalex.org/W2134237243","https://openalex.org/W2518858713","https://openalex.org/W2765934619"],"related_works":["https://openalex.org/W185248416","https://openalex.org/W4312619976","https://openalex.org/W202649520","https://openalex.org/W2381312783","https://openalex.org/W2186303141","https://openalex.org/W2371578151","https://openalex.org/W2057864982","https://openalex.org/W2183214273","https://openalex.org/W2351097202","https://openalex.org/W2014256025"],"abstract_inverted_index":{"SuiteSparse:":[0],"GraphBLAS":[1,8,48,80],"is":[2],"a":[3,12,50,69,95],"full":[4],"implementation":[5],"of":[6,14,22,29,64,94],"the":[7,61,92],"standard,":[9],"which":[10],"defines":[11],"set":[13],"sparse":[15,36,65],"matrix":[16,66],"operations":[17,41,67],"on":[18,46,60,68],"an":[19,25],"extended":[20],"algebra":[21],"semirings":[23],"using":[24],"almost":[26],"unlimited":[27],"variety":[28],"operators":[30],"and":[31,52,81,90],"types.":[32],"When":[33],"applied":[34],"to":[35,44],"adjacency":[37],"matrices,":[38],"these":[39],"algebraic":[40],"are":[42,77],"equivalent":[43],"computations":[45],"graphs.":[47],"provides":[49],"powerful":[51],"expressive":[53],"framework":[54],"for":[55],"creating":[56],"graph":[57,75],"algorithms":[58,76],"based":[59],"elegant":[62],"mathematics":[63],"semiring.":[70],"To":[71],"illustrate":[72],"GraphBLAS,":[73],"two":[74],"constructed":[78],"in":[79],"compared":[82],"with":[83],"efficient":[84],"implementations":[85],"without":[86],"GraphBLAS:":[87],"triangle":[88],"counting":[89],"constructing":[91],"k-truss":[93],"graph.":[96]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":17},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}