37 Terms
Home > Industry/Domain > Computer science > Algorithms & data structures
Algorithms & data structures
The optimization of programming methods and organization of information to achieve a desired result more efficiently.
Industry: Computer science
Add a new termContributors in Algorithms & data structures
Algorithms & data structures
array
Computer science; Algorithms & data structures
An assemblage of items that are randomly accessible by integers, the index. Formal Definition: Ignoring size an array may be seen as an abstract data type with the operations new(), set(i, v, A), and ...
edge coloring
Computer science; Algorithms & data structures
An assignment of colors (or any distinct marks) to the edges of a graph. A coloring is a proper coloring if no two adjacent edges have the same color.
vertex coloring
Computer science; Algorithms & data structures
An assignment of colors (or any distinct marks) to the vertices of a graph. Strictly speaking, a coloring is proper if no two adjacent vertices have the same color.
flow function
Computer science; Algorithms & data structures
An assignment of flow values to the edges of a flow network that satisfies flow conservation, skew symmetry, and capacity constraints.
network flow
Computer science; Algorithms & data structures
An assignment of flow values to the edges of a flow network that satisfies flow conservation, skew symmetry, and capacity constraints.
asymptotic lower bound
Computer science; Algorithms & data structures
An asymptotic bound, as function of the size of the input, on the best (fastest, least amount of space used, etc.) an algorithm can possibly achieve to solve a problem. That is, no algorithm can use ...
asymptotic upper bound
Computer science; Algorithms & data structures
An asymptotic bound, as function of the size of the input, on the worst (slowest, most amount of space used, etc.) an algorithm will do to solve a problem. That is, no input will cause the algorithm ...
