## Viewing Algorithm Design topics

The following topics are immediate sub-topics of Algorithm Design.

• #### Term: Bipartite Matching

• Signs proposed: 0
• Listed under: ... >> Computer Science >> Algorithm Design
• Definition: A matching in a bipartite graph. A bipartite graph is one where the vertices can be partitioned into to sets X and Y, and all edges are between vertices in X and vertices in Y.
• #### Term: Breadth First Search

• Signs proposed: 1 (view signs)
• Listed under: ... >> Computer Science >> Algorithm Design
• Definition: Breadth-first search (BFS) is a graph search algorithm that begins at the root node and explores all the neighboring nodes. Then for each of those nearest nodes, it explores their unexplored neighb...
• #### Term: Clustering

• Signs proposed: 0
• Listed under: ... >> Computer Science >> Algorithm Design
• Definition: A clustering algorithm partitions the vertices of a graph into a number of pairwise disjoint sets that attempts to satisfy some property such as minimizing the number of edges between the sets.
• #### Term: Depth First Search

• Signs proposed: 1 (view signs)
• Listed under: ... >> Computer Science >> Algorithm Design
• Definition: Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph. One starts at the root (selecting some node as the root in the graph case) and explores as far...
• #### Term: Divide And Conquer

• Signs proposed: 0
• Listed under: ... >> Computer Science >> Algorithm Design
• Definition: A divide and conquer algorithm works by recursively breaking down a problem into two or more sub-problems of the same (or related) type, until these become simple enough to be solved directly. The ...
• #### Term: Dynamic Programming

• Signs proposed: 0
• Listed under: ... >> Computer Science >> Algorithm Design
• Definition: Dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. It is applicable to problems exhibiting the properties of overlapping subproblems which ...
• #### Term: Greedy Algorithm

• Signs proposed: 1 (view signs)
• Listed under: ... >> Computer Science >> Algorithm Design
• Definition: A greedy algorithm is any algorithm that follows the problem solving heuristic of making the locally optimal choice at each stage with the hope of finding the global optimum.
• #### Term: Matching

• Signs proposed: 0
• Listed under: ... >> Computer Science >> Algorithm Design
• Definition: Matching or independent edge set in a graph is a set of edges without common vertices. It may also be an entire graph consisting of edges without common vertices.
• #### Term: Maximum Matching

• Signs proposed: 0