local graph
Смотреть что такое "local graph" в других словарях:
Local linearity — is a property of differentiable functions that says roughly that if you zoom in on a point on the graph of the function (with equal scaling horizontally and vertically), the graph will eventually look like a straight line with a slope equal to… … Wikipedia
Local consistency — In constraint satisfaction, local consistency conditions are properties of constraint satisfaction problems related to the consistency of subsets of variables or constraints. Several such conditions exist, the most known being node consistency,… … 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
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
Graph operations — Operations on graphs produce new graphs from old ones. They may be separated into the following major categories. Contents 1 Unary operations 1.1 Elementary operations 1.2 Advanced operations 2 … Wikipedia
Local search (optimization) — In computer science, local search is a metaheuristic for solving computationally hard optimization problems. Local search can be used on problems that can be formulated as finding a solution maximizing a criterion among a number of candidate… … Wikipedia
Local search (constraint satisfaction) — In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. It is based on iteratively improving an assignment of the variables until all constraints are satisfied. In particular, local search algorithms… … Wikipedia
local minimum — noun A point on a graph (or its associated function) such that the points each side have a greater value even though another point exists with a smaller value. See Also: local maximum … Wiktionary
Graphe local — En théorie des graphes, un graphe G est dit être localement X si quel que soit le sommet s de G considéré, le sous graphe induit sur G par les voisins de s est isomorphe à X (si X est un graphe) ou à un graphe appartenant à X (si X est une… … Wikipédia en Français
Connectivity (graph theory) — In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) which need to be removed to disconnect the remaining nodes from each other[1]. It is… … Wikipedia
Neighbourhood (graph theory) — A graph consisting of 6 vertices and 7 edges For other meanings of neighbourhoods in mathematics, see Neighbourhood (mathematics). For non mathematical neighbourhoods, see Neighbourhood (disambiguation). In graph theory, an adjacent vertex of a… … Wikipedia
