Standards for graph algorithm primitives
It is our view that the state of the art in constructing a large collection of graph algorithms in terms of linear algebraic operations is mature enough to support the emergence of a standard set of primitive building blocks. This paper is a position paper defining the problem and announcing our int...
Main Authors: | Mattson, Tim, Bader, David, Berry, Jon, Buluc, Aydin, Dongarra, Jack, Faloutsos, Christos, Feo, John, Gilbert, John, Gonzalez, Joseph, Hendrickson, Bruce, Kepner, Jeremy, Lumsdaine, Andrew, Padua, David, Poole, Stephen, Reinhardt, Steve, Wallach, Steve, Yoo, Andrew, Leiserson, Charles E., Stonebraker, Michael |
---|---|
Other Authors: | Lincoln Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2014
|
Online Access: | http://hdl.handle.net/1721.1/90401 https://orcid.org/0000-0001-9184-9058 |
Similar Items
-
Efficient and effective querying by image content /
by: Faloutsos, Christos -
Searching multimedia databases by content /
by: 381244 Faloutsos, Christos
Published: (1996) -
Generalizations of the primitive element theorem
by: Christos Nikolopoulos, et al.
Published: (1991-01-01) -
Scientific computing with multicore and accelerators /
by: Kurzak, Jakub, et al.
Published: (2010) -
Identifying Primitive Individuals
by: David Wörner
Published: (2024-11-01)