Author : Robert Endre Tarjan
Publisher : SIAM
Page : 133 pages
File Size : 31,56 MB
Release : 1983-01-01
Category : Technology & Engineering
ISBN : 0898711878
This book attempts to provide the reader with a practical understanding and appreciation of the field of graph algorithms.
Author : Pat Morin
Publisher : Athabasca University Press
Page : 336 pages
File Size : 20,48 MB
Release : 2013
Category : Computers
ISBN : 1927356385
Introduction -- Array-based lists -- Linked lists -- Skiplists -- Hash tables -- Binary trees -- Random binary search trees -- Scapegoat trees -- Red-black trees -- Heaps -- Sorting algorithms -- Graphs -- Data structures for integers -- External memory searching.
Author : Jurg Nievergelt
Publisher :
Page : pages
File Size : 25,12 MB
Release : 2011
Category : Algorithms
ISBN :
Author : Allen B. Downey
Publisher : "O'Reilly Media, Inc."
Page : 149 pages
File Size : 26,42 MB
Release : 2017-07-07
Category : Computers
ISBN : 1491972319
If you’re a student studying computer science or a software developer preparing for technical interviews, this practical book will help you learn and review some of the most important ideas in software engineering—data structures and algorithms—in a way that’s clearer, more concise, and more engaging than other materials. By emphasizing practical knowledge and skills over theory, author Allen Downey shows you how to use data structures to implement efficient algorithms, and then analyze and measure their performance. You’ll explore the important classes in the Java collections framework (JCF), how they’re implemented, and how they’re expected to perform. Each chapter presents hands-on exercises supported by test code online. Use data structures such as lists and maps, and understand how they work Build an application that reads Wikipedia pages, parses the contents, and navigates the resulting data tree Analyze code to predict how fast it will run and how much memory it will require Write classes that implement the Map interface, using a hash table and binary search tree Build a simple web search engine with a crawler, an indexer that stores web page contents, and a retriever that returns user query results Other books by Allen Downey include Think Java, Think Python, Think Stats, and Think Bayes.
Author : John Adrian Bondy
Publisher : London : Macmillan Press
Page : 290 pages
File Size : 46,83 MB
Release : 1976
Category : Mathematics
ISBN :
Author : Tomaž Bratanic
Publisher : Simon and Schuster
Page : 350 pages
File Size : 37,46 MB
Release : 2024-02-27
Category : Computers
ISBN : 1617299464
Graph Algorithms for Data Science teaches you how to construct graphs from both structured and unstructured data. You'll learn how the flexible Cypher query language can be used to easily manipulate graph structures, and extract amazing insights. Graph Algorithms for Data Science is a hands-on guide to working with graph-based data in applications. It's filled with fascinating and fun projects, demonstrating the ins-and-outs of graphs. You'll gain practical skills by analyzing Twitter, building graphs with NLP techniques, and much more. These powerful graph algorithms are explained in clear, jargon-free text and illustrations that makes them easy to apply to your own projects.
Author : Mark Needham
Publisher : "O'Reilly Media, Inc."
Page : 297 pages
File Size : 36,70 MB
Release : 2019-05-16
Category : Computers
ISBN : 1492047635
Discover how graph algorithms can help you leverage the relationships within your data to develop more intelligent solutions and enhance your machine learning models. You’ll learn how graph analytics are uniquely suited to unfold complex structures and reveal difficult-to-find patterns lurking in your data. Whether you are trying to build dynamic network models or forecast real-world behavior, this book illustrates how graph algorithms deliver value—from finding vulnerabilities and bottlenecks to detecting communities and improving machine learning predictions. This practical book walks you through hands-on examples of how to use graph algorithms in Apache Spark and Neo4j—two of the most common choices for graph analytics. Also included: sample code and tips for over 20 practical graph algorithms that cover optimal pathfinding, importance through centrality, and community detection. Learn how graph analytics vary from conventional statistical analysis Understand how classic graph algorithms work, and how they are applied Get guidance on which algorithms to use for different types of questions Explore algorithm examples with working code and sample datasets from Spark and Neo4j See how connected feature extraction can increase machine learning accuracy and precision Walk through creating an ML workflow for link prediction combining Neo4j and Spark
Author : Gabriel Valiente
Publisher : Springer Science & Business Media
Page : 492 pages
File Size : 17,40 MB
Release : 2013-04-17
Category : Computers
ISBN : 366204921X
Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, such as approximation, combinatorial optimization, graphics, and operations research, graph algorithms have recently attracted increased attention from computational molecular biology and computational chemistry. Centered around the fundamental issue of graph isomorphism, this text goes beyond classical graph problems of shortest paths, spanning trees, flows in networks, and matchings in bipartite graphs. Advanced algorithmic results and techniques of practical relevance are presented in a coherent and consolidated way. This book introduces graph algorithms on an intuitive basis followed by a detailed exposition in a literate programming style, with correctness proofs as well as worst-case analyses. Furthermore, full C++ implementations of all algorithms presented are given using the LEDA library of efficient data structures and algorithms.
Author : Mark Allen Weiss
Publisher :
Page : 588 pages
File Size : 19,63 MB
Release : 2003
Category : C++ (Computer program language)
ISBN : 9780321189967
In this second edition of his successful book, experienced teacher and author Mark Allen Weiss continues to refine and enhance his innovative approach to algorithms and data structures. Written for the advanced data structures course, this text highlights theoretical topics such as abstract data types and the efficiency of algorithms, as well as performance and running time. Before covering algorithms and data structures, the author provides a brief introduction to C++ for programmers unfamiliar with the language. Dr Weiss's clear writing style, logical organization of topics, and extensive use of figures and examples to demonstrate the successive stages of an algorithm make this an accessible, valuable text. New to this Edition *An appendix on the Standard Template Library (STL) *C++ code, tested on multiple platforms, that conforms to the ANSI ISO final draft standard 0201361221B04062001
Author : Shang-Hua Teng
Publisher :
Page : 292 pages
File Size : 11,39 MB
Release : 2016-05-04
Category : Computers
ISBN : 9781680831306
In the age of Big Data, efficient algorithms are in high demand. It is also essential that efficient algorithms should be scalable. This book surveys a family of algorithmic techniques for the design of scalable algorithms. These techniques include local network exploration, advanced sampling, sparsification, and geometric partitioning.
