- graph junction
-
узел графа
Англо-русский словарь технических терминов. 2005.
graph junction
Смотреть что такое "graph junction" в других словарях:
Junction tree algorithm — The junction tree algorithm is a method used in machine learning for exact marginalization in general graphs. In essence, it entails performing belief propagation on a modified graph called a junction tree. The basic premise is to eliminate… … Wikipedia
Bond graph — A bond graph is a graphical description of a physical dynamic system. It is an energy based graphical technique for building mathematical models of dynamic systems. A bond graph depicts the energy flow between components used to model a system.… … Wikipedia
Chordal graph — A cycle (black) with two chords (green). As for this part, the graph is chordal. However, removing one green edge would result in a non chordal graph. Indeed, the other green edge with three black edges would form a cycle of length four with no… … Wikipedia
List of graph theory topics — This is a list of graph theory topics, by Wikipedia page. See glossary of graph theory for basic terminology Contents 1 Examples and types of graphs 2 Graph coloring 3 Paths and cycles 4 … Wikipedia
p-n junction — A silicon p–n junction with no applied voltage. A p–n junction is formed at the boundary between a P type and N type semiconductor created in a single crystal of semiconductor by doping, for example by ion implantation, diffusion of dopants, or… … Wikipedia
Moral graph — A moral graph is a concept in graph theory, used to find the equivalent undirected form of a directed acyclic graph. It is a key step of the junction tree algorithm, used in belief propagation on graphical models. The moralized counterpart of a… … Wikipedia
Hybrid bond graph — A hybrid bond graph is a graphical description of a physical dynamic system with discontinuities. Similar toa regular bond graph, it is an energy based technique. However, it allows instantaneous switching of the junction structure, which may… … Wikipedia
Tree decomposition — A graph with eight vertices, and a tree decomposition of it onto a tree with six nodes. Each graph edge connects two vertices that are listed together at some tree node, and each graph vertex is listed at the nodes of a contiguous subtree of the… … Wikipedia
Second Intifada — Part of the Israeli–Palestinian conflict and Arab–Israeli conflict Clockwise from above: A masked P … Wikipedia
Maze solving algorithm — There are a number of different maze solving algorithms, that is, automated methods for the solving of mazes. A few important maze solving algorithms are explained below. The random mouse, wall follower, Pledge, and Trémaux algorithms are… … Wikipedia
Diode — Figure 1: Closeup of a diode, showing the square shaped semiconductor crystal (black object on left) … Wikipedia
