Design and analysis of algorithms
Biswaijit, R Bhowmik
Design and analysis of algorithms - New Delhi : S. K. Kataria & Sons, 2012. - xxx, 456 pages : ill.; 24 cm.
Introduction to Algorithms Asymptotic Notations Recursion Vs Recurrence Divide and Conquer Paradigm Dynamic Programming Greedy Approach Backtracking Branch and Bound Lower bound theory Disjoint set manipulation Graph traversals Matrix manipulation algorithms Notion of NP-Completeness Approximation algorithms Large Integers multiplication File Compression Biconnectivity Strongly connected components Topological Sorting Dijkstra's Algorithm
9789350141359
Software engineering
Algorithms
004.421 / BHO
Design and analysis of algorithms - New Delhi : S. K. Kataria & Sons, 2012. - xxx, 456 pages : ill.; 24 cm.
Introduction to Algorithms Asymptotic Notations Recursion Vs Recurrence Divide and Conquer Paradigm Dynamic Programming Greedy Approach Backtracking Branch and Bound Lower bound theory Disjoint set manipulation Graph traversals Matrix manipulation algorithms Notion of NP-Completeness Approximation algorithms Large Integers multiplication File Compression Biconnectivity Strongly connected components Topological Sorting Dijkstra's Algorithm
9789350141359
Software engineering
Algorithms
004.421 / BHO