|
![]() |
|||
|
||||
OverviewGraph algorithms are easy to visualize and indeed there already exists a variety of packages to animate the dynamics when solving problems from graph theory. Still it can be difficult to understand the ideas behind the algorithm from the dynamic display alone. CATBox consists of a software system for animating graph algorithms and a course book which we developed simultaneously. The software system presents both the algorithm and the graph and puts the user always in control of the actual code that is executed. In the course book, intended for readers at advanced undergraduate or graduate level, computer exercises and examples replace the usual static pictures of algorithm dynamics. For this volume we have chosen solely algorithms for classical problems from combinatorial optimization, such as minimum spanning trees, shortest paths, maximum flows, minimum cost flows, weighted and unweighted matchings both for bipartite and non-bipartite graphs. Find more information at http://schliep.org/CATBox/. Full Product DetailsAuthor: Winfried Hochstättler , Alexander SchliepPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Dimensions: Width: 15.50cm , Height: 1.50cm , Length: 23.50cm Weight: 0.350kg ISBN: 9783540148876ISBN 10: 3540148876 Pages: 190 Publication Date: 28 February 2010 Audience: Professional and scholarly , Professional & Vocational Format: Paperback 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. Table of ContentsDiscrete Problems from Applications.- Basics, Notation and Data Structures.- Minimum Spanning Trees.- Linear Programming Duality.- Shortest Paths.- Maximal Flows.- Minimum-Cost Flows.- Matching.- Weighted Matching.ReviewsAus den Rezensionen: Die Visualisierung von Graphenalgorithmen steht im MIttelpunkt des englischsprachigen Buches ... In insgesamt neun Kapiteln werden klassische Probleme der Graphentheorie vorgestellt, wobei ... die notwendigen mathematischen Grundlagen bereitgestellt und die notwendigen Resultate ubersichtlich und vollstandig bewiesen werden. ... Das vorgestellte Buch ist anschaulich, ubersichtlich und passt hervorragend zum Softwarepaket. ... Wer Standardalgorithmen der kombinatorischen Optimierung kennen und verstehen lernen mochte, ist hier an der richtigen Adresse. (in: RHO Mathematik Verein www.math.uni-rostock.de/rho rho math uni-rostock.de, April/2010) Author InformationWinfried Hochstattler is a professor of ""Discrete Mathematics and Optimization"" at FernUniversitat in Hagen. The material of this book has been used for teaching in several courses. Alexander Schliep is a professor in the department of computer science and the BioMaPS institute for quantitative biology at Rutgers University. Gato, derived tools, and parts of CATBox have been used in graduate training at the Max Planck Institut for Molecular Genetics in Berlin. Tab Content 6Author Website:Countries AvailableAll regions |