node set

См. также в других словарях:

• node number —    The number that uniquely identifies a network interface card and distinguishes it from all others.    Node numbers can be assigned in different ways. Ethernet node numbers are factoryset, so no two Ethernet boards have the same number. On… …   Dictionary of networking

• Disjoint-set data structure — In computing, a disjoint set data structure is a data structure that keeps track of a set of elements partitioned into a number of disjoint (nonoverlapping) subsets. A union find algorithm is an algorithm that performs two useful operations on… …   Wikipedia

• Nested 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

• Information set (game theory) — In game theory, an information set is a set that, for a particular player, establishes all the possible moves that could have taken place in the game so far, given what that player has observed so far. If the game has perfect information, every… …   Wikipedia

• Orbital node — The ascending node. An orbital node is one of the two points where an orbit crosses a plane of reference to which it is inclined.[1] An orbit which is contained in the plane of reference (called non inclined) has no nodes …   Wikipedia

• Connected dominating set — In graph theory, a connected dominated set and a maximum leaf spanning tree are two closely related structures defined on an undirected graph. Contents 1 Definitions 2 Complementarity 3 Algorithms 4 Applic …   Wikipedia

• Longitude of the ascending node — The longitude of the ascending node (☊ or Ω) is one of the orbital elements used to specify the orbit of an object in space. It is the angle from a reference direction, called the origin of longitude , to the direction of the ascending node,… …   Wikipedia

• Tree (descriptive set theory) — In descriptive set theory, a tree on a set X is a set of finite sequences of elements of X that is closed under subsequences. More formally, it is a subset T of X^{ …   Wikipedia

• Blank node — In RDF, a blank node or anonymous resource or bnode ) is a resource, or node in an RDF graph, which is not identified by a URI. A blank node can be used as subject or object in an RDF triple. Example John has a friend born the 21st of April can… …   Wikipedia

• Morass (set theory) — For the variety of wetland, see marsh. In axiomatic set theory, a mathematical discipline, a morass is an infinite combinatorial structure, used to create large structures from a small number of small approximations. They were invented by Ronald… …   Wikipedia

• Internationalization Tag Set — The [http://www.w3.org/TR/its/ Internationalization Tag Set (ITS)] is a set of attributes and elements designed to provide internationalization and localization support in XML documents.The ITS specification identifies concepts (called ITS data… …   Wikipedia