About: GraphBLAS     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/c/4P8eAAH76S

GraphBLAS (/ˈɡræfˌblɑːz/) is an API specification that defines standard building blocks for graph algorithms in the language of linear algebra. GraphBLAS is built upon the notion that a sparse matrix can be used to represent graphs as either an adjacency matrix or an incidence matrix. The GraphBLAS specification describes how graph operations (e.g. traversing and transforming graphs) can be efficiently implemented via linear algebraic methods (e.g. matrix multiplication) over different semirings.

AttributesValues
rdfs:label
  • GraphBLAS (en)
rdfs:comment
  • GraphBLAS (/ˈɡræfˌblɑːz/) is an API specification that defines standard building blocks for graph algorithms in the language of linear algebra. GraphBLAS is built upon the notion that a sparse matrix can be used to represent graphs as either an adjacency matrix or an incidence matrix. The GraphBLAS specification describes how graph operations (e.g. traversing and transforming graphs) can be efficiently implemented via linear algebraic methods (e.g. matrix multiplication) over different semirings. (en)
foaf:homepage
foaf:depiction
  • http://commons.wikimedia.org/wiki/Special:FilePath/AdjacencyMatrixGraphBLASBFS.png
  • http://commons.wikimedia.org/wiki/Special:FilePath/GraphBLAS_logo.png
dct:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
thumbnail
caption
  • The logo of the GraphBLAS API (en)
domain
  • Graph algorithms (en)
license
pages
quote
  • "In most cases, the 0 element is standard arithmetic 0, but in other cases it can be a different value. Nonstandard 0 values can be helpful when combined with different ⊕ and ⊗ operations." (en)
section
status
  • Released (en)
title
  • GraphBLAS Specification (en)
version
version date
website
has abstract
  • GraphBLAS (/ˈɡræfˌblɑːz/) is an API specification that defines standard building blocks for graph algorithms in the language of linear algebra. GraphBLAS is built upon the notion that a sparse matrix can be used to represent graphs as either an adjacency matrix or an incidence matrix. The GraphBLAS specification describes how graph operations (e.g. traversing and transforming graphs) can be efficiently implemented via linear algebraic methods (e.g. matrix multiplication) over different semirings. The development of GraphBLAS and its various implementations is an ongoing community effort, including representatives from industry, academia, and government research labs. (en)
at
  • "VII. 0-Element: No Graph Edge" (en)
first published
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git147 as of Sep 06 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3332 as of Dec 5 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 53 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software