(computing theory) An algorithm that generates aesthetically pleasing drawings of binary trees (and by extension, n-ary trees).

plural of Reingold-Tilford algorithm

Synonym of Ramer-Douglas-Peucker algorithm

(computer science, graph theory) An algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles).

A method for minimization of Boolean functions, functionally identical to Karnaugh mapping, but having a tabular form that is more efficient in computer algorithms. It is based on finding prime implicants.

(computing theory) An algorithm for approximating the number of distinct elements in a stream with a single pass and logarithmic space consumption.

(computing) A search procedure which involves generating and checking all possible scenarios.

(computing theory) A method for parsing mathematical expressions specified in infix notation.

(computing theory) An iterative heuristic algorithm for bipartitioning a hypergraph.

(computing theory) A heuristic algorithm for finding partitions of graphs, having important applications in the layout of digital circuits and components in VLSI.