- reduced graph
- мат. редуцированный граф;
приведенный граф
Большой англо-русский и русско-английский словарь. 2001.
reduced graph
Смотреть что такое "reduced graph" в других словарях:
Reduced Binary Circuits — Reduced Binary Circuit stellen eine Möglichkeit dar, digitale Schaltkreise mit wenig Overhead kompakt zu repräsentieren. Resultat ist ein gerichteter azyklischer Graph G bestehend aus Knoten und Kanten. Interne Knoten repräsentieren einen binären … Deutsch Wikipedia
Graph cuts in computer vision — As applied in the field of computer vision, graph cuts can be employed to efficiently solve a wide variety of low level computer vision problems ( early vision ), such as image smoothing, the stereo correspondence problem, and many other computer … Wikipedia
Feynman graph — A Feynman graph is a graph suitable to be a Feynman diagram in a particular application of quantum field theory. (The most common use is when each field has quanta (particles) associated with it as the quantum of the electromagnetic field is a… … Wikipedia
Line graph of a hypergraph — The line graph of a hypergraph is the graph whose vertex set is the set of the hyperedges of the hypergraph, with two edges adjacent when they have nonempty intersection. In other words, the line graph of a hypergraph is the intersection graph of … Wikipedia
Intersection number (graph theory) — In the mathematical field of graph theory, the intersection number of a graph is the smallest number of elements in a representation of G as an intersection graph of finite sets. Equivalently, it is the smallest number of cliques needed to cover… … Wikipedia
Entitative graph — An entitative graph is an element of the graphical syntax for logic that Charles Sanders Peirce developed under the name of qualitative logic beginning in the 1880 s, taking the coverage of the formalism only as far as the propositional or… … Wikipedia
Scene graph — A scene graph is a general data structure commonly used by vector based graphics editing applications and modern computer games. Examples of such programs include AutoCAD, Adobe Illustrator, Acrobat 3D, OpenSceneGraph and CorelDRAW.The scene… … Wikipedia
Tree (graph theory) — Trees A labeled tree with 6 vertices and 5 edges Vertices v Edges v 1 Chromatic number … Wikipedia
Connected component (graph theory) — A graph with three connected components. In graph theory, a connected component of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, and which is connected to no additional vertices. For example,… … Wikipedia
Existential graph — An existential graph is a type of diagrammatic or visual notation for logical expressions, proposed by Charles Sanders Peirce, who wrote his first paper on graphical logic in 1882 and continued to develop the method until his death in 1914.The… … Wikipedia
Cheeger constant (graph theory) — In mathematics, the Cheeger constant (also Cheeger number or isoperimetric number) of a graph is a numerical measure of whether or not a graph has a bottleneck . The Cheeger constant as a measure of bottleneckedness is of great interest in many… … Wikipedia
