adjacency
51Digital topology — deals with properties and features of two dimensional (2D) or three dimensional (3D) digital images that correspond to topological properties (e.g., connectedness) or topological features (e.g., boundaries) of objects. Concepts and results of… …
52Forest of stars — A forest of stars is a set of star worlds whose adjacency matrix is a tree. This means that no intersecting star worlds create a cycle, or hole, in the overall space. If an object or space can be represented by a forest of stars, it can be mapped …
53IFMP — Название: Ipsilon Flow Management Protocol Уровень (по модели OSI): Канальный Создан в: 1996 г. Спецификация: RFC 1953 IFMP (англ. Ipsilon Flow Management Protocol Протокол управления потоком …
54Dependency network — Contents 1 Importance 2 Overview 3 The activity dependency networks …
55Adjacence — Ad ja cence, Adjacency Ad*ja cen*cy, [Cf. LL. adjacentia.] 1. The state or attribute of being adjacent or contiguous; contiguity; the attribute of being so near as to be touching; as, the adjacency of lands or buildings. Syn: contiguousness [1913 …
56Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… …
57Geographic information system — GIS redirects here. For other uses, see GIS (disambiguation). A geographic information system, geographical information science, or geospatial information studies is a system designed to capture, store, manipulate, analyze, manage, and present… …
58PageRank — is a link analysis algorithm that assigns a numerical weighting to each element of a hyperlinked set of documents, such as the World Wide Web, with the purpose of measuring its relative importance within the set. The algorithm may be applied to… …
59P-complete — In complexity theory, the notion of P complete decision problems is useful in the analysis of both: which problems are difficult to parallelize effectively, and; which problems are difficult to solve in limited space. Formally, a decision problem …
60Regular graph — In graph theory, a regular graph is a graph where each vertex has the same number of neighbors, i.e. every vertex has the same degree or valency. A regular graph with vertices of degree k is called a kregular graph or regular graph of degree… …
