-
1 algorithm
- aim algorithm
- automatic placement and routing algorithm
- backward error recovery algorithm
- best path algorithm
- bit-map oriented spatial processing algorithm
- block-oriented algorithm
- branch and bound algorithm
- channel algorithm
- D algorithm
- deductive algorithm
- discard algorithm
- exact embedding algorithm
- expansion algorithm
- fast-Fourier-transform algorithm
- graph-based algorithm
- Gummel’s algorithm
- hidden-line algorithm
- image processing algorithm
- iterative algorithm
- Lee algorithm
- min-cut algorithm
- modified Lee algorithm
- N-step algorithm
- one-direction algorithm
- pessimistic simulation algorithm
- random-search algorithm
- repair-most algorithm
- Roth’s D algorithm
- routing algorithm
- Schonhage algorithm
- selective-trace algorithm
- sequential algorithm
- stable sorting algorithm
- star algorithm
- table-driven algorithm
- 9-value D- algorithm
- wiring algorithmEnglish-Ukrainian dictionary of microelectronics > algorithm
См. также в других словарях:
oriented graph — orientuotasis grafas statusas T sritis automatika atitikmenys: angl. directed graph; oriented graph vok. gerichteter Graph, m; orientierter Graph, m rus. орграф, m; ориентированный граф, m pranc. graphe de fluence, m; graphe directe, m; graphe… … Automatikos terminų žodynas
Oriented coloring — In graph theory, oriented graph coloring is a special type of graph coloring. Namely, it is an assignment of colors to vertices of an oriented graph that is proper: no two adjacent vertices get the same color, and respects the orientation: if… … Wikipedia
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
Oriented matroid — theory allows a combinatorial approach to the max flow min cut theorem. A network with the value of flow equal to the capacity of an s t cut An oriented matroid is a mathematical structure that abstracts the properties of directed graphs and of… … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Directed graph — A directed graph. A directed graph or digraph is a pair G = (V,A) (sometimes G = (V,E)) of:[1] a set V, whose elements are called vertices or … Wikipedia
Tournament (graph theory) — Tournament A tournament on 4 vertices Vertices n Edges … Wikipedia
directed graph — orientuotasis grafas statusas T sritis automatika atitikmenys: angl. directed graph; oriented graph vok. gerichteter Graph, m; orientierter Graph, m rus. орграф, m; ориентированный граф, m pranc. graphe de fluence, m; graphe directe, m; graphe… … Automatikos terminų žodynas
gerichteter Graph — orientuotasis grafas statusas T sritis automatika atitikmenys: angl. directed graph; oriented graph vok. gerichteter Graph, m; orientierter Graph, m rus. орграф, m; ориентированный граф, m pranc. graphe de fluence, m; graphe directe, m; graphe… … Automatikos terminų žodynas
orientierter Graph — orientuotasis grafas statusas T sritis automatika atitikmenys: angl. directed graph; oriented graph vok. gerichteter Graph, m; orientierter Graph, m rus. орграф, m; ориентированный граф, m pranc. graphe de fluence, m; graphe directe, m; graphe… … Automatikos terminų žodynas