Basic Concepts of Graph Algorithms: Combinatorics for Computer Science - Tapa blanda

Williamson, S. Gill

 
9781500276812: Basic Concepts of Graph Algorithms: Combinatorics for Computer Science
Tapa blanda
ISBN 10: 1500276812 ISBN 13: 9781500276812
Editorial: CreateSpace Independent Publishing Platform, 2014

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
CreateSpace Independent Publishing Platform
Año de publicación
2014
Idioma
Inglés
ISBN 10 
1500276812
ISBN 13 
9781500276812
Encuadernación
Tapa blanda
Número de páginas
106
Contacto del fabricante
no disponible
Persona responsable
no disponible