Data Structures and Algorithms 2. Graph Algorithms and NP-Completeness
β Scribed by Mehlhorn K.
- Publisher
- Springer
- Year
- 1984
- Tongue
- English
- Leaves
- 224
- Series
- EATCS Monographs on Theoretical Computer Science 2
- Category
- Library
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and machine learning. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical interviews. Algorithms I
Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and machine learning. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical interviews. Algorithms I
<p><span>This is the first book devoted to the systematic study of sparse graphs and sparse finite structures. Although the notion of sparsity appears in various contexts and is a typical example of a hard to define notion, the authors devised an unifying classification of general classes of structu
<div><div><b>PeelingΒ </b>Data Structures and Algorithms<b>Β </b><b>for interviewsΒ </b><b>[re-printed on 19-November-2015]:Β </b></div><div><div><div><b>Table of Contents</b>:Β goo.gl/UeLODK</div><div><b></b></div><div><b>Sample Chapter</b>:Β goo.gl/remIdp</div><div><b>Found Issue?Β </b>goo.gl/forms/4Gt72