Graph Algorithms in the Language of Linear Algebra - Bookswagon
close menu
Bookswagon
search
My Account
Home > Computer programming / software engineering > Algorithms and data structures > Graph Algorithms in the Language of Linear Algebra: (Software Environments and Tools)
Graph Algorithms in the Language of Linear Algebra: (Software Environments and Tools)

Graph Algorithms in the Language of Linear Algebra: (Software Environments and Tools)


     0     
5
4
3
2
1



International Edition


X
About the 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.

Table of Contents:

  • List of Figures
  • List of Tables
  • List of Algorithms
  • Preface
  • Acknowledgments
  • Part I: Algorithms: Chapter 1: Graphs and Matrices
  • Chapter 2: Linear Algebraic Notation and Definitions
  • Chapter 3: Connected Components and Minimum Paths
  • Chapter 4: Some Graph Algorithms in an Array-Based Language
  • Chapter 5: Fundamental Graph Algorithms
  • Chapter 6: Complex Graph Algorithms
  • Chapter 7: Multilinear Algebra for Analyzing Data with Multiple Linkages
  • Chapter 8: Subgraph Detection
  • Part II: Data: Chapter 9: Kronecker Graphs
  • Chapter 10: The Kronecker Theory of Power Law Graphs
  • Chapter 11: Visualizing Large Kronecker Graphs
  • Part III: Computation: Chapter 12: Large-Scale Network Analysis
  • Chapter 13: Implementing Sparse Matrices for Graph Algorithms
  • Chapter 14: New Ideas in Sparse Matrix-Matrix Multiplication
  • Chapter 15: Parallel Mapping of Sparse Computations
  • Chapter 16: Fundamental Questions in the Analysis of Large Graphs
  • Index.


    About the Author :
    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.


    Best Sellers


    Product Details
    • ISBN-13: 9780898719901
    • Publisher: Society for Industrial & Applied Mathematics,U.S.
    • Publisher Imprint: Society for Industrial & Applied Mathematics,U.S.
    • Height: 229 mm
    • No of Pages: 388
    • Series Title: Software Environments and Tools
    • Weight: 1010 gr
    • ISBN-10: 0898719909
    • Publisher Date: 30 Jul 2011
    • Binding: Hardback
    • Language: English
    • Returnable: N
    • Spine Width: 23 mm
    • Width: 152 mm


    Similar Products

    Add Photo
    Add Photo

    Customer Reviews

    REVIEWS      0     
    Click Here To Be The First to Review this Product
    Graph Algorithms in the Language of Linear Algebra: (Software Environments and Tools)
    Society for Industrial & Applied Mathematics,U.S. -
    Graph Algorithms in the Language of Linear Algebra: (Software Environments and Tools)
    Writing guidlines
    We want to publish your review, so please:
    • keep your review on the product. Review's that defame author's character will be rejected.
    • Keep your review focused on the product.
    • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
    • Refrain from mentioning competitors or the specific price you paid for the product.
    • Do not include any personally identifiable information, such as full names.

    Graph Algorithms in the Language of Linear Algebra: (Software Environments and Tools)

    Required fields are marked with *

    Review Title*
    Review
      Add Photo Add up to 6 photos
      Would you recommend this product to a friend?
      Tag this Book Read more
      Does your review contain spoilers?
      What type of reader best describes you?
      I agree to the terms & conditions
      You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

      CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

      These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


      By submitting any content to Bookswagon, you guarantee that:
      • You are the sole author and owner of the intellectual property rights in the content;
      • All "moral rights" that you may have in such content have been voluntarily waived by you;
      • All content that you post is accurate;
      • You are at least 13 years old;
      • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
      You further agree that you may not submit any content:
      • That is known by you to be false, inaccurate or misleading;
      • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
      • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
      • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
      • For which you were compensated or granted any consideration by any unapproved third party;
      • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
      • That contains any computer viruses, worms or other potentially damaging computer programs or files.
      You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


      For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


      All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

      Accept

      Fresh on the Shelf


      Inspired by your browsing history


      Your review has been submitted!

      You've already reviewed this product!
      Your IP: 216.73.217.2 IN