Graph Algorithms in the Language of Linear Algebra
Title | Graph Algorithms in the Language of Linear Algebra PDF eBook |
Author | Jeremy Kepner |
Publisher | SIAM |
Pages | 388 |
Release | 2011-01-01 |
Genre | Mathematics |
ISBN | 9780898719918 |
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.
Graphs, Networks and Algorithms
Title | Graphs, Networks and Algorithms PDF eBook |
Author | Dieter Jungnickel |
Publisher | Springer Science & Business Media |
Pages | 597 |
Release | 2013-06-29 |
Genre | Mathematics |
ISBN | 3662038226 |
Revised throughout Includes new chapters on the network simplex algorithm and a section on the five color theorem Recent developments are discussed
Graph Theory and Sparse Matrix Computation
Title | Graph Theory and Sparse Matrix Computation PDF eBook |
Author | Alan George |
Publisher | Springer Science & Business Media |
Pages | 254 |
Release | 2012-12-06 |
Genre | Mathematics |
ISBN | 1461383692 |
When reality is modeled by computation, matrices are often the connection between the continuous physical world and the finite algorithmic one. Usually, the more detailed the model, the bigger the matrix, the better the answer, however, efficiency demands that every possible advantage be exploited. The articles in this volume are based on recent research on sparse matrix computations. This volume looks at graph theory as it connects to linear algebra, parallel computing, data structures, geometry, and both numerical and discrete algorithms. The articles are grouped into three general categories: graph models of symmetric matrices and factorizations, graph models of algorithms on nonsymmetric matrices, and parallel sparse matrix algorithms. This book will be a resource for the researcher or advanced student of either graphs or sparse matrices; it will be useful to mathematicians, numerical analysts and theoretical computer scientists alike.
Introduction to Applied Linear Algebra
Title | Introduction to Applied Linear Algebra PDF eBook |
Author | Stephen Boyd |
Publisher | Cambridge University Press |
Pages | 477 |
Release | 2018-06-07 |
Genre | Business & Economics |
ISBN | 1316518965 |
A groundbreaking introduction to vectors, matrices, and least squares for engineering applications, offering a wealth of practical examples.
Topics in Intersection Graph Theory
Title | Topics in Intersection Graph Theory PDF eBook |
Author | Terry A. McKee |
Publisher | SIAM |
Pages | 213 |
Release | 1999-01-01 |
Genre | Mathematics |
ISBN | 9780898719802 |
Finally there is a book that presents real applications of graph theory in a unified format. This book is the only source for an extended, concentrated focus on the theory and techniques common to various types of intersection graphs. It is a concise treatment of the aspects of intersection graphs that interconnect many standard concepts and form the foundation of a surprising array of applications to biology, computing, psychology, matrices, and statistics.
Graphs and Matrices
Title | Graphs and Matrices PDF eBook |
Author | Ravindra B. Bapat |
Publisher | Springer |
Pages | 197 |
Release | 2014-09-19 |
Genre | Mathematics |
ISBN | 1447165691 |
This new edition illustrates the power of linear algebra in the study of graphs. The emphasis on matrix techniques is greater than in other texts on algebraic graph theory. Important matrices associated with graphs (for example, incidence, adjacency and Laplacian matrices) are treated in detail. Presenting a useful overview of selected topics in algebraic graph theory, early chapters of the text focus on regular graphs, algebraic connectivity, the distance matrix of a tree, and its generalized version for arbitrary graphs, known as the resistance matrix. Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive definite completion problem and matrix games based on a graph. Such an extensive coverage of the subject area provides a welcome prompt for further exploration. The inclusion of exercises enables practical learning throughout the book. In the new edition, a new chapter is added on the line graph of a tree, while some results in Chapter 6 on Perron-Frobenius theory are reorganized. Whilst this book will be invaluable to students and researchers in graph theory and combinatorial matrix theory, it will also benefit readers in the sciences and engineering.
Graph Structure and Monadic Second-Order Logic
Title | Graph Structure and Monadic Second-Order Logic PDF eBook |
Author | Bruno Courcelle |
Publisher | Cambridge University Press |
Pages | 743 |
Release | 2012-06-14 |
Genre | Mathematics |
ISBN | 1139644009 |
The study of graph structure has advanced in recent years with great strides: finite graphs can be described algebraically, enabling them to be constructed out of more basic elements. Separately the properties of graphs can be studied in a logical language called monadic second-order logic. In this book, these two features of graph structure are brought together for the first time in a presentation that unifies and synthesizes research over the last 25 years. The authors not only provide a thorough description of the theory, but also detail its applications, on the one hand to the construction of graph algorithms, and, on the other to the extension of formal language theory to finite graphs. Consequently the book will be of interest to graduate students and researchers in graph theory, finite model theory, formal language theory, and complexity theory.