Contact at mumbai.academics@gmail.com or 8097636691
Responsive Ads Here

Saturday, 3 March 2018

Algorithms

2. Algorithms
  • Basics of Algorithm Analysis
  • Graphs
  • Divide and Conquer
  • Greedy Algorithms
  • Dynamic Programming
  • Network Flow
  • NP and Computational Intractability
  • PSCAPE; A Class of Problems Beyond NP
  • Extending the Limits of Tractability
  • Approximation Algorithms
  • Randomized Algorithms
  • Local Search
  • Design and Analysis of Algorithms
  • Algorithmic Design Patterns
  • Algorithmic Framework
  • Data Structure
  • Combinatorial Algorithms
  • Geometric Algorithms
  • Numerical Algorithms
  • Internet Algorithms
  • Spanning-Trees, Branchings and Connectivity
  • Planar Graphs
  • Network and Flows
  • Matchings
  • Eulerian and Hamiltonian Tours
  • Colouring Graph
  • Graphs Problems and Intractability
  • Fundamental Techniques
  • Weighted Graphs
  • Text Processing
  • Network Algorithms
  • NP-Completeness
  • Sorting
  • No comments:

    Post a Comment