There has been an explosive growth in the field ofcombinatorial algorithms. These algorithms depend not only onresults in combinatorics and especially in graph theory, but alsoon the development of new data structures and new techniques foranalyzing algorithms. Four classical problems in networkoptimization are covered in detail, including a development of thedata structures they use and an analysis of their running time.Data Structures and Network Algorithms attempts to provide thereader with both a practical understanding of the algorithms,described to facilitate their easy implementation, and anappreciation of the depth and beauty of the field of graphalgorithms.
Structural proof theory is a branch of logic that studies thegeneral structure and properties of logical and mathematicalproofs. This book is both a concise introduction to the centralresults and methods of structural proof theory, and a work ofresearch that will be of interest to specialists. The book isdesigned to be used by students of philosophy, mathematics andcomputer science. The book contains a wealth of results onproof-theoretical systems, including extensions of such systemsfrom logic to mathematics, and on the connection between the twomain forms of structural proof theory - natural deduction andsequent calculus. The authors emphasize the computational contentof logical results. A special feature of the volume is acomputerized system for developing proofs interactively,downloadable from the web and regularly updated.
