We analysed more than 40 000 000 questions and answers on stackoverflow.com to bring you the top of most mentioned books (5720 in total)

How we did it:

  • We got database dump of all user-contributed content on the Stack Exchange network (can be downloaded here)
  • Extracted questions and answers made on stackoverflow
  • Found all amazon.com links and counted it
  • Created tag-based search for your convenience
  • Brought it to you

For any feedback, any questions, any notes or just for chat - feel free to follow us on social networks

Recomended tags

Top graph books mentioned on stackoverflow.com

Clean Code

Robert C. Martin

An extremely pragmatic method for writing better code from the start, and ultimately producing more robust applications.

More on Amazon.com

Introduction to Algorithms, 3rd Edition

Thomas H. Cormen

Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called "Divide-and-Conquer"), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added for this edition. As of the third edition, this textbook is published exclusively by the MIT Press.

More on Amazon.com

Purely Functional Data Structures

Chris Okasaki

This book describes data structures and data structure design techniques for functional languages.

More on Amazon.com

Introduction To Algorithms

Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, Clifford Stein

An extensively revised edition of a mathematically rigorous yet accessible introduction to algorithms.

More on Amazon.com

The Algorithm Design Manual

Steven S. Skiena

Expanding on the highly successful formula of the first edition, this book now serves as the primary textbook of choice for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms.

More on Amazon.com

The Algorithm Design Manual: Text

Steven S. Skiena

This volume helps take some of the "mystery" out of identifying and dealing with key algorithms. Drawing heavily on the author's own real-world experiences, the book stresses design and analysis. Coverage is divided into two parts, the first being a general guide to techniques for the design and analysis of computer algorithms. The second is a reference section, which includes a catalog of the 75 most important algorithmic problems. By browsing this catalog, readers can quickly identify what the problem they have encountered is called, what is known about it, and how they should proceed if they need to solve it. This book is ideal for the working professional who uses algorithms on a daily basis and has need for a handy reference. This work can also readily be used in an upper-division course or as a student reference guide.THE ALGORITHM DESIGN MANUAL comes with a CD-ROM that contains:* a complete hypertext version of the full printed book.* the source code and URLs for all cited implementations.* over 30 hours of audio lectures on the design and analysis of algorithms are provided, all keyed to on-line lecture notes.

More on Amazon.com

Artificial Intelligence

Stuart Jonathan Russell, Peter Norvig

Artificial intelligence: A Modern Approach, 3e,is ideal for one or two-semester, undergraduate or graduate-level courses in Artificial Intelligence. It is also a valuable resource for computer professionals, linguists, and cognitive scientists interested in artificial intelligence. The revision of this best-selling text offers the most comprehensive, up-to-date introduction to the theory and practice of artificial intelligence.

More on Amazon.com

Programming Challenges

Steven S. Skiena, Miguel A. Revilla

Presents a collection of more than one hundred programming challenges along with information on key theories and concepts in computer programming.

More on Amazon.com

Programming Game AI by Example

Mat Buckland

Provides an introduction to AI game techniques used in game programming.

More on Amazon.com

Introduction to Algorithms

Udi Manber

This book emphasizes the creative aspects of algorithm design by examining steps used in the process of algorithm development. The heart of the creative process lies in an analogy between proving mathematical theorems by induction and designing combinatorial algorithms. The book contains hundreds of problems and examples. It is designed to enhance the reader's problem-solving abilities and understanding of the principles behind algorithm design. 0201120372B04062001

More on Amazon.com

Algorithms in C++, Parts 1-4

Robert Sedgewick

Robert Sedgewick has thoroughly rewritten and substantially expanded and updated his popular work to provide current and comprehensive coverage of important algorithms and data structures. Christopher Van Wyk and Sedgewick have developed new C++ implementations that both express the methods in a concise and direct manner, and also provide programmers with the practical means to test them on real applications. Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers! This particular book, Parts 1n4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. Although the substance of the book applies to programming in any language, the implementations by Van Wyk and Sedgewick also exploit the natural match between C++ classes and ADT implementations. Highlights Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures Greater emphasis on abstract data types (ADTs), modular programming, object-oriented programming, and C++ classes than in previous editions Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations New implementations of binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and much more Increased quantitative information about the algorithms, giving you a basis for comparing them Over 1000 new exercises to help you learn the properties of algorithms Whether you are learning the algorithms for the first time or wish to have up-to-date reference material that incorporates new programming styles with classic and new algorithms, you will find a wealth of useful information in this book.

More on Amazon.com

Introduction to Algorithms and Java CD-ROM

Thomas Cormen, Charles Leiserson, Ronald Rivest, Clifford Stein

The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Like the first edition, this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects. In its new edition, Introduction to Algorithms continues to provide a comprehensive introduction to the modern study of algorithms. The revision has been updated to reflect changes in the years since the book's original publication. New chapters on the role of algorithms in computing and on probabilistic analysis and randomized algorithms have been included. Sections throughout the book have been rewritten for increased clarity, and material has been added wherever a fuller explanation has seemed useful or new information warrants expanded coverage. As in the classic first edition, this new edition of Introduction to Algorithms presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers. Further, the algorithms are presented in pseudocode to make the book easily accessible to students from all programming language backgrounds. Each chapter presents an algorithm, a design technique, an application area, or a related topic. The chapters are not dependent on one another, so the instructor can organize his or her use of the book in the way that best suits the course's needs. Additionally, the new edition offers a 25% increase over the first edition in the number of problems, giving the book 155 problems and over 900 exercises that reinforce the concepts the students are learning.

More on Amazon.com

Joe Celko's Trees and Hierarchies in SQL for Smarties

Joe Celko

Provides information on developing database applications in SQL, covering such topics as adjacendy list model, nested sets, binary trees, data modeling, graphs, and hierarchical database systems.

More on Amazon.com

Structure and Interpretation of Computer Programs

Harold Abelson, Gerald Jay Sussman, Julie Sussman

"Structure and Interpretation of Computer Programs" has had a dramatic impact on computer science curricula over the past decade. This long-awaited revision contains changes throughout the text. There are new implementations of most of the major programming systems in the book, including the interpreters and compilers, and the authors have incorporated many small changes that reflect their experience teaching the course at MIT since the first edition was published. A new theme has been introduced that emphasizes the central role played by different approaches to dealing with time in computational models: objects with state, concurrent programming, functional programming and lazy evaluation, and nondeterministic programming. There are new example sections on higher-order procedures in graphics and on applications of stream processing in numerical programming, and many new exercises. In addition, all the programs have been reworked to run in any Scheme implementation that adheres to the IEEE standard.

More on Amazon.com

Bundle of Algorithms in Java

Robert Sedgewick

The daughter of a millionaire racing driver, Woolf Barnato and granddaughter of Barney Barnato who co-founded the De Beers mining company, by 1936 Diana had had enough of her affluent, chaperoned existence and sought excitement in flying, soloing at Brooklands after only six hours' training. She has followed her own instincts ever since.

More on Amazon.com

Programming the Semantic Web

Toby Segaran, Colin Evans, Jamie Taylor

Provides information on using the programming techniques of the Semantic Web to create, enrich, and simplify Web applications.

More on Amazon.com

Kicking Butt with MIDP and MSA

Jonathan Knudsen

The release of MIDP 2.0 and the introduction of the new Mobile Service Architecture (MSA) are generating momentum for the Java ME platform. As more and more Java-enabled mobile devices become available and more service providers become open to third-party development, the demand for customized applications will grow dramatically. Now, there's a practical, realistic guide to building MIDP 2.0/MSA applications that are robust, responsive, maintainable, and fun. Long-time Java ME author Jonathan Knudsen offers real solutions for the complex challenges of coding efficiency, application design, and usability in constrained mobile environments. Experienced Java developers will master MIDP 2.0 and MSA programming through clear, carefully designed examples. Downloadable code is available for both NetBeans Mobility Pack and the Sun Java Wireless Toolkit. Kicking Butt with MIDP and MSA 's wide-ranging content covers: Pushing MIDP's limits, and exploiting MSA's full power Using MIDlets, Forms, commands, core classes, and invocation Building effective mobile user interfaces Designing graphics with the Canvas, the Game API, SVG, and 3D Providing storage and resources: record stores, FileConnection, and PDA PIM Internationalizing mobile applications Networking via WMA, Bluetooth, Web services, and SIP Parsing XML documents Implementing audio and advanced multimedia Securing mobile applications with SATSA and the Payment API Building advanced location-based applications Designing applications for multiple devices Creating end-to-end mobile application architectures

More on Amazon.com

Algorithms in C++

Robert Sedgewick

Once again, Robert Sedgewick provides a current and comprehensive introduction to important algorithms. The focus this time is on graph algorithms, which are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In this book, Sedgewick offers the same successful blend of theory and practice that has made his work popular with programmers for many years. Christopher van Wyk and Sedgewick have developed concise new C++ implementations that both express the methods in a natural and direct manner and also can be used in real applications. "Algorithms in C++, Third Edition, Part 5: Graph Algorithms " is the second book in Sedgewick's thoroughly revised and rewritten series. The first book, Parts 1-4, addresses fundamental algorithms, data structures, sorting, and searching. A forthcoming third book will focus on strings, geometry, and a range of advanced algorithms. Each book's expanded coverage features new algorithms and implementations, enhanced descriptions and diagrams, and a wealth of new exercises for polishing skills. A focus on abstract data types makes the programs more broadly useful and relevant for the modern object-oriented programming environment. Coverage includes: A complete overview of graph properties and types Diagraphs and DAGs Minimum spanning trees Shortest paths Network flows Diagrams, sample C++ code, and detailed algorithm descriptions The Web site for this book (http: //www.cs.princeton.edu/ rs/) provides additional source code for programmers along with a wide range of academic support materials for educators. A landmark revision, " Algorithms in C++, Third Edition, Part 5 " provides a complete tool set for programmers to implement, debug, and use graph algorithms across a wide range of computer applications. 0201361183B11282001

More on Amazon.com

Algorithms in Java

Robert Sedgewick

In these volumes, Robert Sedgewick focuses on practical applications, giving readers all the information, diagrams and real code they need to confidently implement, debug and use the algorithms he presents.

More on Amazon.com

The boost graph library

Jeremy Siek, Lie-Quan Lee, Andrew Lumsdaine

CD-ROM contains: Source code of BGL -- Fully searchable hyperlinked version of text.

More on Amazon.com

Algorithms in C

Robert Sedgewick

Defines and explores the implementation and figures of the algorithms required for various applications, offering commentary, descriptions, and exercises for developers, researchers, and students.

More on Amazon.com

A Java Library of Graph Algorithms and Optimization

Hang T. Lau

Collecting some of the most popular graph algorithms and optimization procedures, A Java Library of Graph Algorithms and Optimization provides the source code for a library of Java programs that can be used to solve problems in graph theory and combinatorial optimization. Self-contained and largely independent, each topic starts with a problem description and an outline of the solution procedure, followed by its parameter list specification, source code, and a test example that illustrates the usage of the code. An accompanying CD-ROM contains all of the Java code included in the book.

More on Amazon.com

Semiparametric Regression

David Ruppert, M. P. Wand, R. J. Carroll

This user-friendly 2003 book explains the techniques and benefits of semiparametric regression in a concise and modular fashion.

More on Amazon.com

Graph Drawing

Giuseppe Di Battista

This book is designed to describe fundamental algorithmic techniques for constructing drawings of graphs. Suitable as a book or reference manual, its chapters offer an accurate, accessible reflection of the rapidly expanding field of graph drawing.

More on Amazon.com

Beginning algorithms

Simon Harris, James Ross

* After guiding readers through the basics of algorithms and data structures, this book examines specific algorithms that will help readers in programming tasks * Begins with a discussion of the basics-how to determine the characteristics of a given algorithm-then introduces practical sorting algorithms, and gradually moves on to fundamental data structures * Companion Web site features unique, Java-based working implementations and examples built and tested by the author

More on Amazon.com

Beginning Python Visualization

Shai Vaingast

We are visual animals. But before we can see the world in its true splendor, our brains, just like our computers, have to sort and organize raw data, and then transform that data to produce new images of the world. Beginning Python Visualization: Crafting Visual Transformation Scripts discusses turning many types of small data sources into useful visual data. And, you will learn Python as part of the bargain. What you’ll learn Write ten lines of code and present visual information instead of data soup. Set up an open source environment ready for data visualization. Forget Excel: use Python. Learn numerical and textual processing. Draw graphs and plots based on textual and numerical data. Learn how to deal with images. Who this book is for IT personnel, programmers, engineers, and hobbyists interested in acquiring and displaying data from the Web, sensors, economic trends, and even astronomical sources.

More on Amazon.com

ADTs, Data Structures, and Problem Solving with C++

Larry R. Nyhoff

Reflecting the newest trends in computer science, new and revised material throughout the Second Edition of this book places increased emphasis on abstract data types (ADTs) and object-oriented design. This book continues to offer a thorough, well-organized, and up-to-date presentation of essential principles and practices in data structures using C++. Topics include C++'s I/O and string classes, pointers and dynamic allocation, lists, array-based and linked-list implementations of stacks, queues, searching, inheritance and more. For computer professionals in companies that have computing departments or those who want advanced training in C++.

More on Amazon.com

Graph Drawing Software

Michael Juenger, Petra Mutzel

After an introduction to the subject area and a concise treatment of the technical foundations for the subsequent chapters, this book features 14 chapters on state-of-the-art graph drawing software systems, ranging from general "tool boxes'' to customized software for various applications. These chapters are written by leading experts: they follow a uniform scheme and can be read independently from each other. The text covers many industrial applications.

More on Amazon.com

The Game of Cops and Robbers on Graphs

Anthony Bonato

This book is the first and only one of its kind on the topic of Cops and Robbers games, and more generally, on the field of vertex pursuit games on graphs. The book is written in a lively and highly readable fashion, which should appeal to both senior undergraduates and experts in the field (and everyone in between). One of the main goals of the book is to bring together the key results in the field; as such, it presents structural, probabilistic, and algorithmic results on Cops and Robbers games. Several recent and new results are discussed, along with a comprehensive set of references. The book is suitable for self-study or as a textbook, owing in part to the over 200 exercises. The reader will gain insight into all the main directions of research in the field and will be exposed to a number of open problems.

More on Amazon.com

Graph Theory and Its Applications, Second Edition

Jonathan L. Gross, Jay Yellen

Already an international bestseller, with the release of this greatly enhanced second edition, Graph Theory and Its Applications is now an even better choice as a textbook for a variety of courses -- a textbook that will continue to serve your students as a reference for years to come. The superior explanations, broad coverage, and abundance of illustrations and exercises that positioned this as the premier graph theory text remain, but are now augmented by a broad range of improvements. Nearly 200 pages have been added for this edition, including nine new sections and hundreds of new exercises, mostly non-routine. What else is new? New chapters on measurement and analytic graph theory Supplementary exercises in each chapter - ideal for reinforcing, reviewing, and testing. Solutions and hints, often illustrated with figures, to selected exercises - nearly 50 pages worth Reorganization and extensive revisions in more than half of the existing chapters for smoother flow of the exposition Foreshadowing - the first three chapters now preview a number of concepts, mostly via the exercises, to pique the interest of reader Gross and Yellen take a comprehensive approach to graph theory that integrates careful exposition of classical developments with emerging methods, models, and practical needs. Their unparalleled treatment provides a text ideal for a two-semester course and a variety of one-semester classes, from an introductory one-semester course to courses slanted toward classical graph theory, operations research, data structures and algorithms, or algebra and topology.

More on Amazon.com