Graph Algorithms in the Language of Linear Algebra

Valutazione media 4,25
( su 4 valutazioni fornite da GoodReads )
 
9780898719901: Graph Algorithms in the Language of Linear Algebra

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Descrizione del libro:

The field of graph algorithms has become one of the pillars of theoretical computer science. This is an introduction to graph algorithms accessible to anyone with a strong linear algebra background – it allows non-computer science trained engineers and scientists to quickly understand and apply graph algorithms.

L'autore:

Jeremy Kepner is a senior technical staff member at the Massachusetts Institute of Technology Lincoln Laboratory. His research focuses on the development of advanced libraries for the application of massively parallel computing to a variety of data intensive signal processing problems on which he has published many articles.

John Gilbert is a SIAM Fellow and Professor of Computer Science at the University of California, Santa Barbara. His research interests are in combinatorial scientific computing, high-performance graph algorithms, tools and software for computational science and engineering, numerical linear algebra and distributed sensing and control.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

I migliori risultati di ricerca su AbeBooks

1.

Jeremy Kepner, John Gilbert
Editore: Society for Industrial Applied Mathematics,U.S., United States (2011)
ISBN 10: 0898719909 ISBN 13: 9780898719901
Nuovi Rilegato Quantità: 1
Da
The Book Depository
(London, Regno Unito)
Valutazione libreria
[?]

Descrizione libro Society for Industrial Applied Mathematics,U.S., United States, 2011. Hardback. Condizione libro: New. 259 x 183 mm. Language: English . Brand New Book. Graphs are among the most important abstract data types in computer science, and the algorithms that operate on them are critical to modern life. Graphs have been shown to be powerful tools for modeling complex problems because of their simplicity and generality. Graph algorithms are one of the pillars of mathematics, informing research in such diverse areas as combinatorial optimization, complexity theory, and topology. Algorithms on graphs are applied in many ways in today s world - from Web rankings to metabolic networks, from finite element meshes to semantic graphs. The current exponential growth in graph data has forced a shift to parallel computing for executing graph algorithms. Implementing parallel graph algorithms and achieving good parallel performance have proven difficult. This book addresses these challenges 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. Graph Algorithms in the Language of Linear Algebra is the first book to cover graph algorithms accessible to engineers and scientists not trained in computer science but having a strong linear algebra background, enabling them to quickly understand and apply graph algorithms.It also covers array-based graph algorithms, showing readers how to express canonical graph algorithms using a highly elegant and efficient array notation and how to tap into the large range of tools and techniques that have been built for matrices and tensors; parallel array-based algorithms, demonstrating with examples how to easily implement parallel graph algorithms using array-based approaches, which enables readers to address much larger graph problems; and array-based theory for analyzing graphs, providing a template for using array-based constructs to develop new theoretical approaches for graph analysis. Codice libro della libreria AAN9780898719901

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 118,84
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
Da: Regno Unito a: Italia
Destinazione, tempi e costi

2.

Kepner, Jeremy
Editore: Society for Industrial and Applied Mathematics (2011)
ISBN 10: 0898719909 ISBN 13: 9780898719901
Nuovi Quantità: 4
Da
Books2Anywhere
(Fairford, GLOS, Regno Unito)
Valutazione libreria
[?]

Descrizione libro Society for Industrial and Applied Mathematics, 2011. HRD. Condizione libro: New. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Codice libro della libreria CE-9780898719901

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 108,89
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 11,80
Da: Regno Unito a: Italia
Destinazione, tempi e costi

3.

Kepner, Jeremy; Gilbert, John
Editore: Society for Industrial Applied Mathematics,U.S., United States (2011)
ISBN 10: 0898719909 ISBN 13: 9780898719901
Nuovi Rilegato Quantità: 1
Da
The Book Depository US
(London, Regno Unito)
Valutazione libreria
[?]

Descrizione libro Society for Industrial Applied Mathematics,U.S., United States, 2011. Hardback. Condizione libro: New. 259 x 183 mm. Language: English . Brand New Book. Graphs are among the most important abstract data types in computer science, and the algorithms that operate on them are critical to modern life. Graphs have been shown to be powerful tools for modeling complex problems because of their simplicity and generality. Graph algorithms are one of the pillars of mathematics, informing research in such diverse areas as combinatorial optimization, complexity theory, and topology. Algorithms on graphs are applied in many ways in today s world - from Web rankings to metabolic networks, from finite element meshes to semantic graphs. The current exponential growth in graph data has forced a shift to parallel computing for executing graph algorithms. Implementing parallel graph algorithms and achieving good parallel performance have proven difficult. This book addresses these challenges 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. Graph Algorithms in the Language of Linear Algebra is the first book to cover graph algorithms accessible to engineers and scientists not trained in computer science but having a strong linear algebra background, enabling them to quickly understand and apply graph algorithms.It also covers array-based graph algorithms, showing readers how to express canonical graph algorithms using a highly elegant and efficient array notation and how to tap into the large range of tools and techniques that have been built for matrices and tensors; parallel array-based algorithms, demonstrating with examples how to easily implement parallel graph algorithms using array-based approaches, which enables readers to address much larger graph problems; and array-based theory for analyzing graphs, providing a template for using array-based constructs to develop new theoretical approaches for graph analysis. Codice libro della libreria AAN9780898719901

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 122,99
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
Da: Regno Unito a: Italia
Destinazione, tempi e costi

4.

Jeremy Kepner, John Gilbert
Editore: Society for Industrial & Applied Mathematics,U.S.
ISBN 10: 0898719909 ISBN 13: 9780898719901
Nuovi Rilegato Quantità: 2
Da
THE SAINT BOOKSTORE
(Southport, Regno Unito)
Valutazione libreria
[?]

Descrizione libro Society for Industrial & Applied Mathematics,U.S. Hardback. Condizione libro: new. BRAND NEW, Graph Algorithms in the Language of Linear Algebra, Jeremy Kepner, John Gilbert, 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. Codice libro della libreria B9780898719901

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 122,08
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 7,02
Da: Regno Unito a: Italia
Destinazione, tempi e costi

5.

Jeremy Kepner, John Gilbert
Editore: Society for Industrial & Applied Mathematics (2011)
ISBN 10: 0898719909 ISBN 13: 9780898719901
Nuovi Rilegato Quantità: 1
Da
Ergodebooks
(RICHMOND, TX, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Society for Industrial & Applied Mathematics, 2011. Hardcover. Condizione libro: New. Codice libro della libreria DADAX0898719909

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 132,13
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 12,88
Da: U.S.A. a: Italia
Destinazione, tempi e costi

6.

Kepner, Jeremy; Gilbert, John
Editore: Society for Industrial & Applied Mathematics (2011)
ISBN 10: 0898719909 ISBN 13: 9780898719901
Nuovi Rilegato Quantità: 1
Da
Irish Booksellers
(Rumford, ME, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Society for Industrial & Applied Mathematics, 2011. Hardcover. Condizione libro: New. book. Codice libro della libreria 0898719909

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 151,24
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 11,04
Da: U.S.A. a: Italia
Destinazione, tempi e costi

7.

Kepner, Jeremy/ Gilbert, John
Editore: Society for Industrial & Applied (2011)
ISBN 10: 0898719909 ISBN 13: 9780898719901
Nuovi Rilegato Quantità: 2
Da
Revaluation Books
(Exeter, Regno Unito)
Valutazione libreria
[?]

Descrizione libro Society for Industrial & Applied, 2011. Hardcover. Condizione libro: Brand New. 361 pages. 10.50x7.25x1.00 inches. In Stock. Codice libro della libreria __0898719909

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 154,26
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 17,69
Da: Regno Unito a: Italia
Destinazione, tempi e costi

8.

Kepner, Jeremy, Gilbert, John
Editore: Society for Industrial & Appli (2011)
ISBN 10: 0898719909 ISBN 13: 9780898719901
Nuovi Rilegato Quantità: 2
Da
Murray Media
(North Miami Beach, FL, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Society for Industrial & Appli, 2011. Hardcover. Condizione libro: New. Codice libro della libreria P110898719909

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 165,22
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 18,39
Da: U.S.A. a: Italia
Destinazione, tempi e costi