Ebook: Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness
Author: Kurt Mehlhorn
- Tags: Computation by Abstract Devices, Data Structures, Algorithm Analysis and Problem Complexity
- Series: EATCS Monographs on Theoretical Computer Science 2
- Year: 1984
- Publisher: Springer
- Language: English
- pdf
Content:
Front Matter....Pages I-XII
Algorithms on Graphs....Pages 1-132
Path Problems in Graphs and Matrix Multiplication....Pages 133-170
NP-Completeness....Pages 171-243
Algorithmic Paradigms....Pages 244-251
Back Matter....Pages 252-262
Content:
Front Matter....Pages I-XII
Algorithms on Graphs....Pages 1-132
Path Problems in Graphs and Matrix Multiplication....Pages 133-170
NP-Completeness....Pages 171-243
Algorithmic Paradigms....Pages 244-251
Back Matter....Pages 252-262
....
Download the book Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness for free or read online
Continue reading on any device:
Last viewed books
Related books
{related-news}
Comments (0)