skip to content
Graph algorithms in the language of linear algebra Preview this item
ClosePreview this item

Graph algorithms in the language of linear algebra

Author: Jeremy V Kepner; J R Gilbert
Publisher: Philadelphia : Society for Industrial and Applied Mathematics, ©2011.
Series: Software, environments, tools.
Edition/Format:   Print book : EnglishView all editions and formats
Summary:
Publisher description: The field of graph algorithms has become one of the pillars of theoretical computer science, informing research in such diverse areas as combinatorial optimization, complexity theory and topology. To improve the computational performance of graph algorithms, researchers have proposed a shift to a parallel computing paradigm. This book addresses the challenges of implementing parallel graph  Read more...
Getting this item's online copy... Getting this item's online copy...

Find a copy in the library

Getting this item's location and availability... Getting this item's location and availability...

WorldCat

Find it in libraries globally
Worldwide libraries own this item

Details

Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: Jeremy V Kepner; J R Gilbert
ISBN: 9780898719901 0898719909
OCLC Number: 704556857
Description: xxvii, 361 pages : illustrations (some color) ; 27 cm.
Contents: Algorithms. Graphs and matrices / J. Kepner --
Linear algebraic notation and definitions / E. Robinson, J. Kepner, and J. Gilbert --
Connected components and minimum paths / C.M. Rader --
Some graph algorithms in an array-based language / V.B. Shah, J. Gilbert, and S. Reinhardt --
Fundamental graph algorithms / J.T. Fineman and E. Robinson --
Complex graph algorithms / E. Robinson --
Multilinear algebra for analyzing data with multiple linkages / D. Dunlavy, T. Kolda, and W.P. Kegelmeyer --
Subgraph detection / J. Kepner --
Data. Kronecker graphs / J. Leskovec --
The Kronecker theory of power law graphs / J. Kepner --
Visualizing large Kronecker graphs / H. Nguyen, J. Kepner, and A. Edelman --
Computation. Large-scale network analysis / D.A. Bader, C. Heitsch, and K. Madduri --
Implementing sparse matrices for graph algorithms / A. Buluç, J. Gilbert, and V.B. Shah --
New ideas in sparse matrix matrix multiplication / A. Buluç and J. Gilbert --
Parallel mapping of sparse computations / E. Robinson, N. Bliss, and S. Mohindra --
Fundamental questions in the analysis of large graphs / J. Kepner [and others].
Series Title: Software, environments, tools.
Responsibility: Jeremy Kepner, John Gilbert.

Abstract:

Publisher description: The field of graph algorithms has become one of the pillars of theoretical computer science, informing research in such diverse areas as combinatorial optimization, complexity theory and topology. To improve the computational performance of graph algorithms, researchers have proposed a shift to a parallel computing paradigm. This book addresses the challenges of implementing parallel graph algorithms by exploiting the well-known duality between a canonical representation of graphs as abstract collections of vertices and edges and a sparse adjacency matrix representation. This linear algebraic approach is widely accessible to scientists and engineers who may not be formally trained in computer science. The authors show how to leverage existing parallel matrix computation techniques and the large amount of software infrastructure that exists for these computations to implement efficient and scalable parallel graph algorithms. The benefits of this approach are reduced algorithmic complexity, ease of implementation and improved performance.
Retrieving notes about this item Retrieving notes about this item

Reviews

User-contributed reviews

Tags

Be the first.

Similar Items

Related Subjects:(4)

User lists with this item (1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.