Algorithms on Graphs

Graph theory is always an active area of mathematics research - especially the search for efficient algorithms. Although many well-developed procedures have appeared in various books and journals, ready-to-use computer code has never been available in one easily accessible resource. Algorithms on Graphs provides a ready source of plug-in code for some of the most interesting and useful algorithms yet developed. It is a unique resource designed for the busy professional - a resource that you will want to keep close at hand every day, featuring a library of computer programs dealing with the mathematical principles of: Connectivity, Shortest paths, Traversability, Node Coloring, Minimum Spanning Tree, Maximum Cardinality Matching, and Planarity Testing All programs are complete and ready to use.