This book introduces graph algorithms on an intuitive basis followed by a detailed exposition in a literate programming style, with correctness proofs as well as worst-case analyses. Full C++ implementations of all algorithms presented are given using the LEDA library of efficient data structures and algorithms.
Author: Gabriel Valiente
Binding Type: Hardcover
Publisher: Springer
Published: 10/12/2021
Series: Texts in Computer Science
Pages: 387
Weight: 1.63lbs
Size: 9.21h x 6.14w x 0.94d
ISBN: 9783030818845
2nd 2021 Edition
About the Author
Gabriel Valiente, PhD, is an accredited Full Professor at the Department of Computer Science and a member of the Algorithms, Bioinformatics, Complexity and Formal Methods Research Group of the Technical University of Catalonia in Barcelona, Spain. He has been lecturing on Data Structures and Algorithms at the undergraduate level and Advanced Graph Algorithms at the graduate level over the last several years. His current research is centered on combinatorial algorithms on graphs and, in particular, algorithms for comparing trees and graphs, with emphasis on algorithms in computational biology and bioinformatics.
Ezra's Archive Does not ship outside of the United States
Delivery Options:
1. Economy:
Estimated Delivery Time - 5 to 8 Business Days
Shipping Cost - $4.15
2. USPS Priority:
Estimated Delivery Time - 1 to 3 Business Days
Shipping Cost - $8.85
3. Free Economy Shipping: Only Applicable to Orders over $60
Returns and Refunds:
Purchased items are not eligible to be returned. However, a refund or item replacement may be granted should an item be damaged or misplaced during shipping. To make a refund or replacement claim please contact us via email at Ezra'sArchive@outlook.com