Graph Theory (Paperback)

Gould Gould

ISBN 10: 0486498069 / ISBN 13: 9780486498065

Edité par Dover Publications Inc., New York, 2012

A propos de cet article

Paperback. This introduction to graph theory focuses on well-established topics, covering primary techniques and including both algorithmic and theoretical problems. The algorithms are presented with a minimum of advanced data structures and programming details. This thoroughly corrected 1988 edition provides insights to computer scientists as well as advanced undergraduates and graduate students of topology, algebra, and matrix theory. Fundamental concepts and notation and elementary properties and operations are the first subjects, followed by examinations of paths and searching, trees, and networks. Subsequent chapters explore cycles and circuits, planarity, matchings, and independence. The text concludes with considerations of special topics and applications and extremal theory. Exercises appear throughout the text. An introductory text in graph theory, this treatment covers primary techniques and includes both algorithmic and theoretical problems. Algorithms are presented with a minimum of advanced data structures and programming details. 1988 edition. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

N° de réf. du vendeur 9780486498065

Détails bibliographiques

• Titre: Graph Theory (Paperback)
• Éditeur: Dover Publications Inc., New York
• Date de parution: 2012
• Langue: anglais
• ISBN à 10 chiffres: 0486498069
• ISBN à 13 chiffres: 9780486498065
• Reliure: Paperback
• État de l'article: new

A propos de ce titre

Synopsis

This introduction to graph theory focuses on well-established topics, covering primary techniques and including both algorithmic and theoretical problems. The algorithms are presented with a minimum of advanced data structures and programming details. This thoroughly corrected 1988 edition provides insights to computer scientists as well as advanced undergraduates and graduate students of topology, algebra, and matrix theory.
Fundamental concepts and notation and elementary properties and operations are the first subjects, followed by examinations of paths and searching, trees, and networks. Subsequent chapters explore cycles and circuits, planarity, matchings, and independence. The text concludes with considerations of special topics and applications and extremal theory. Exercises appear throughout the text.

À propos de l?auteur

Ronald Gould is Professor of Mathematics and Computer Science at Emory University. He specializes in combinatorics and graph theory and is most noted for his work in Hamiltonian graph theory.