Full Product Details
Author: Gabriel Valiente
Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition: 2002 ed.
Dimensions:
Width: 15.50cm
, Height: 2.80cm
, Length: 23.50cm
Weight: 1.950kg
ISBN: 9783540435501
ISBN 10: 3540435506
Pages: 489
Publication Date: 05 September 2002
Audience:
College/higher education
,
Professional and scholarly
,
Undergraduate
,
Postgraduate, Research & Scholarly
Replaced By: 9783030818845
Format: Hardback
Publisher's Status: Active
Availability: In Print
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.
Reviews
From the reviews: <p> The main theme of this (research) monograph on graph algorithms is the isomorphism problem (for trees and graphs). Algorithms are both described on an intuitive basis and presented (and discussed) in detail using Knutha (TM)s literate programming style (C++, using the LEDA library). Besides offering an introduction to an interesting and important subject (with applications, e.g., in biology and chemistry), it also is a valuable (and unified) reference to material previously only available in research papers. (P. Schmitt, Monatshefte fA1/4r Mathematik, Vol. 142 (4), 2004) <p> The book goes beyond classical graph problems and addresses algorithmic problems with practical applications. a ] will have a great potential in the hands of a dedicated teacher who is both willing and capable of using the software. Because much of the material in the book was previously only available in specialized research literature, this book will be very valuable also for researchers of algorithmic graph theory. This richly illustrated book has an extensive bibliography and several appendices describing the software. (Matti Vuorinen, Zentralblatt MATH, Vol. 1007, 2003)
From the reviews: The main theme of this (research) monograph on graph algorithms is the isomorphism problem (for trees and graphs). Algorithms are both described on an intuitive basis and presented (and discussed) in detail using Knuth's literate programming style (C++, using the LEDA library). Besides offering an introduction to an interesting and important subject (with applications, e.g., in biology and chemistry), it also is a valuable (and unified) reference to material previously only available in research papers. (P. Schmitt, Monatshefte fur Mathematik, Vol. 142 (4), 2004) The book goes beyond classical graph problems and addresses algorithmic problems with practical applications. ! will have a great potential in the hands of a dedicated teacher who is both willing and capable of using the software. Because much of the material in the book was previously only available in specialized research literature, this book will be very valuable also for researchers of algorithmic graph theory. This richly illustrated book has an extensive bibliography and several appendices describing the software. (Matti Vuorinen, Zentralblatt MATH, Vol. 1007, 2003)
From the reviews: The main theme of this (research) monograph on graph algorithms is the isomorphism problem (for trees and graphs). Algorithms are both described on an intuitive basis and presented (and discussed) in detail using Knuth's literate programming style (C++, using the LEDA library). Besides offering an introduction to an interesting and important subject (with applications, e.g., in biology and chemistry), it also is a valuable (and unified) reference to material previously only available in research papers. (P. Schmitt, Monatshefte fur Mathematik, Vol. 142 (4), 2004) The book goes beyond classical graph problems and addresses algorithmic problems with practical applications. ... will have a great potential in the hands of a dedicated teacher who is both willing and capable of using the software. Because much of the material in the book was previously only available in specialized research literature, this book will be very valuable also for researchers of algorithmic graph theory. This richly illustrated book has an extensive bibliography and several appendices describing the software. (Matti Vuorinen, Zentralblatt MATH, Vol. 1007, 2003)
