Name: Basic Concepts of Graph Algorithms: Combinatorics for Computer Science
Price: 557.00 TWD
Availability: InStock
Author: Williamson, S. Gill
ISBN: 9781500276812

Select your country

Americas

Europe

Rest of the world

portada Basic Concepts of Graph Algorithms: Combinatorics for Computer Science

Basic Concepts of Graph Algorithms: Combinatorics for Computer Science

Type

Physical Book

Author

S. Gill Williamson

Publisher

Createspace

Language

English

Pages

108

Format

Paperback

Dimensions

27.9 x 21.6 x 0.6 cm

Weight

0.27 kg.

ISBN13

9781500276812

Synopsis "Basic Concepts of Graph Algorithms: Combinatorics for Computer Science"

We describe and study the interplay between intuition and the precise description of graph algorithms. We learn how to use ordered rooted trees to develop and describe complex recursive algorithms. Depth first search, lineal spanning trees, chords, and backedges are used to understand complex algorithms such as those for biconnectivity and planarity. More general algoithms such as orderly algorithms are discussed in detail. We focus on the visualization of algorithms through the use of graphical and pictorial methods. This approach is both fun and powerful, preparing you to invent your own algorithms for a wide range of problems.

Customers reviews

Have you read this book? Login to add your review.

More customer reviews

0% (0)
0% (0)
0% (0)
0% (0)
0% (0)

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews

Basic Concepts of Graph Algorithms: Combinatorics for Computer Science - Williamson, S. Gill

Synopsis "Basic Concepts of Graph Algorithms: Combinatorics for Computer Science"

Customers reviews

Frequently Asked Questions about the Book

Is the book original?

In what language is the book written?

What is the format of this book?

Questions and Answers about the Book

Opinions about Bookdelivery