- Industry: Technology
- Number of terms: 2742
- Number of blossaries: 0
- Company Profile:
The National Institute of Standards and Technology (NIST) — known between 1901 and 1988 as the National Bureau of Standards (NBS) — is a measurement standards laboratory and a non-regulatory agency of the United States Department of Commerce. The institute's official mission is to promote U.S. ...
The problem of finding occurrence(s) of a pattern string within another string or body of text. There are many different algorithms for efficient searching.
Industry:Computer science
The problem of finding occurrence(s) of a pattern string within another string or body of text. There are many different algorithms for efficient searching.
Industry:Computer science
The problem of finding the maximum flow between any two vertices of a directed graph.
Industry:Computer science
The problem of finding the maximum flow between any two vertices of a directed graph.
Industry:Computer science
The problem of finding the shortest path in a graph from one vertex to another. "Shortest" may be least number of edges, least total weight, etc.
Industry:Computer science
The problem of finding the shortest path in a graph from one vertex to another. "Shortest" may be least number of edges, least total weight, etc.
Industry:Computer science
The problem of reaching a consensus among distributed units if some of them give misleading answers. To be memorable, the problem is couched in terms of generals deciding on a common plan of attack. Some traitorous generals may lie about whether they will support a particular plan and what other generals told them. Exchanging only messages, what decision making algorithm should the generals use to reach a consensus? What percentage of liars can the algorithm tolerate and still correctly determine a consensus?
Industry:Computer science
The problem of representing a graph in a plane "neatly," for instance with a minimum number of edge crossings.
Industry:Computer science
The process of transforming a graph into a planar graph. More formally, the transformation involves either removing edges (planarization by edge removal), or replacing pairs of nonincident edges by 4-starts (planarization by adding crossing vertices). In both cases, the aim of planarization is minimize the number of edge removals or replacements.
Industry:Computer science
The property that a complete weighted graph satisfies weight(u,v) ≤ weight(u,w) + weight(w,v) for all vertices u, v, w. Informally, the graph has no short cuts.
Industry:Computer science
