adjacency

  • 21Adjacency pairs — An adjacency pair, used in conversational analysis, is a pair of conversational turns by two different speakers such that the production of the first turn (called a first pair part) makes a response (a second pair part) of a particular kind… …

    Wikipedia

  • 22Adjacency effects — Пограничные эффекты проявления …

    Краткий толковый словарь по полиграфии

  • 23adjacency effect — noun : a change in size, density, or other property of a photographic image sometimes observed when small adjacent images are close enough to influence each other and when such a change is not to be expected from the normal sensitometric… …

    Useful english dictionary

  • 24Seidel adjacency matrix — In mathematics, in graph theory, the Seidel adjacency matrix of a simple graph G (also called the Seidel matrix and the original name the (−1,1,0) adjacency matrix) is the symmetric matrix with a row and column for each vertex, having 0 on the… …

    Wikipedia

  • 25Nested set model — The nested set model is a particular technique for representing nested sets (also known as trees or hierarchies) in relational databases. The term was apparently introduced by Joe Celko; others describe the same technique without naming it [1] or …

    Wikipedia

  • 26Glossary 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

  • 27Graph (data structure) — In computer science, a graph is a kind of data structure, specifically an abstract data type (ADT), that consists of a set of nodes (also called vertices) and a set of edges that establish relationships (connections) between the nodes. The graph… …

    Wikipedia

  • 28List of matrices — This page lists some important classes of matrices used in mathematics, science and engineering: Matrices in mathematics*(0,1) matrix a matrix with all elements either 0 or 1. Also called a binary matrix . *Adjugate matrix * Alternant matrix a… …

    Wikipedia

  • 29Cisco Express Forwarding — (CEF) is an advanced layer 3 switching technology used mainly in large core networks or the Internet to enhance the overall network performance. Function CEF is mainly used to increase packet switching speed by reducing the overhead and delays… …

    Wikipedia

  • 30Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and …

    Wikipedia

  • 31Prim's algorithm — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional …

    Wikipedia

  • 32Spectral graph theory — In mathematics, spectral graph theory is the study of properties of a graph in relationship to the characteristic polynomial, eigenvalues, and eigenvectors of its adjacency matrix or Laplacian matrix. An undirected graph has a symmetric adjacency …

    Wikipedia

  • 33Two-graph — In mathematics, a two graph is a set of (unordered) triples chosen from a finite vertex set X , such that every (unordered) quadruple from X contains an even number of triples of the two graph. A regular two graph has the property that every pair …

    Wikipedia

  • 34Open Shortest Path First — (OSPF) is an adaptive routing protocol for Internet Protocol (IP) networks. It uses a link state routing algorithm and falls into the group of interior routing protocols, operating within a single autonomous system (AS). It is defined as OSPF… …

    Wikipedia

  • 35List 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

  • 36Kronecker product — In mathematics, the Kronecker product, denoted by otimes, is an operation on two matrices of arbitrary size resulting in a block matrix. It is a special case of a tensor product. The Kronecker product should not be confused with the usual matrix… …

    Wikipedia

  • 37Distance matrix — In mathematics, computer science and graph theory, a distance matrix is a matrix (two dimensional array) containing the distances, taken pairwise, of a set of points. This matrix will have a size of N×N where N is the number of points, nodes or… …

    Wikipedia

  • 38Centrality — Within graph theory and network analysis, there are various measures of the centrality of a vertex within a graph that determine the relative importance of a vertex within the graph (for example, how important a person is within a social network …

    Wikipedia

  • 39Eigenvalue, eigenvector and eigenspace — In mathematics, given a linear transformation, an Audio|De eigenvector.ogg|eigenvector of that linear transformation is a nonzero vector which, when that transformation is applied to it, changes in length, but not direction. For each eigenvector… …

    Wikipedia

  • 40Geospatial topology — Topology In a Geographic Information System GIS, topology is a set of rules which define the relationship between points, lines, and polygons. ESRI enables topology generation within their geodatabase feature classes. Network topology explores… …

    Wikipedia