ISBN: 9783540148876
ID: 9783540148876
Graph algorithms are easy to visualize and indeed there already exists a variety of packages and programs to animate the dynamics when solving problems from graph theory. Still, and somewhat surprisingly, 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 Graph algorithms are easy to visualize and indeed there already exists a variety of packages and programs to animate the dynamics when solving problems from graph theory. Still, and somewhat surprisingly, 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. He or she can set breakpoints, proceed in single steps and trace into subroutines. The graph, and additional auxiliary graphs like residual networks, are displayed and provide visual feedback. The course book, intended for readers at advanced undergraduate or graduate level, introduces the ideas and discusses the mathematical background necessary for understanding and verifying the correctness of the algorithms and their complexity. 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 as well as weighted and unweighted matchings both for bipartite and non-bipartite graphs. We consider non-bipartite weighted matching, in particular in the geometrical case, a highlight of combinatorial optimization. In order to enable the reader to fully enjoy the beauty of the primal-dual solution algorithm for weighted matching, we present all mathematical material not only from the point of view of graph theory, but also with an emphasis on linear programming and its duality. This yields insightful and aesthetically pleasing pictures for matchings, but also for minimum spanning trees. You can find more information at http://schliep.org/CATBox/. Textbooks New, Books~~Mathematics~~Combinatorics, CATBox~~Winfried-Hochstattler, 999999999, CATBox: An Interactive Course in Combinatorial Optimization, Winfried Hochstattler, Alexander Schliep, 3540148876, Springer Berlin Heidelberg, , , , , Springer Berlin Heidelberg
Barnesandnoble.com
MPN: , SKU 9783540148876 Shipping costs:zzgl. Versandkosten, plus shipping costs
Details... |
ISBN: 9783540148876
ID: 8ab0bd54d43e3949ace4f6b2857dea4e
CATBox consists of a software system for animating graph algorithms and a course book developed simultaneously. The software system presents both the algorithm and the graph. The course book introduces the background necessary for understanding the algorithms. Graph 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/. Buch / Mathematik, Naturwissenschaft & Technik / Informatik & EDV / Informatik, [PU: Springer, Berlin/Heidelberg]
Buecher.de
Nr. 14754903 Shipping costs:, , DE. (EUR 0.00)
Details... |
2010
ISBN: 3540148876
ID: 13409052986
[EAN: 9783540148876], Neubuch, [PU: SPRINGER PG], New Book. This item is printed on demand. Shipped from US
Abebooks.de
Paperbackshop-US, Secaucus, NJ, U.S.A. [8408184] [Rating: 5 (von 5)]
NEW BOOK Shipping costs: EUR 8.74 Details... |
2010, ISBN: 9783540148876
ID: 11460514236
PAPERBACK, Neubuch, BRAND NEW BOOK! Shipped within 24-48 hours. Normal delivery time is 5-12 days., [PU: Springer]
Alibris.com |
Abebooks.de
Chiron Media, Wallingford, United Kingdom [55661942] [Rating: 5 (von 5)]
NEW BOOK Shipping costs: EUR 4.08 Details... |
Author: | |
Title: | CATBox |
ISBN: | 9783540148876 |
Details of the book - CATBox
EAN (ISBN-13): 9783540148876
ISBN (ISBN-10): 3540148876
Hardcover
Paperback
Publishing year: 2010
Publisher: Springer-Verlag GmbH
190 Pages
Weight: 0,347 kg
Language: Englisch
Book in our database since 10.06.2008 23:25:28
Book found last time on 29.04.2016 01:57:51
ISBN/EAN: 9783540148876
ISBN - alternate spelling:
3-540-14887-6, 978-3-540-14887-6