Weitere Beispiele werden automatisch zu den Stichwörtern zugeordnet - wir garantieren ihre Korrektheit nicht.
Multiple or disjoint text spans can be represented by more than one objects.
Take a given tour and delete k mutually disjoint edges.
The unconnected ones are just disjoint unions of these.
A 0-handle is just a ball, and the attaching map is disjoint union.
There is a disjoint population in northern Hungary.
Choice: Let the members of B be disjoint nonempty sets.
Customers would see it as a totally disjoint product line requiring all-new software from them.
Therefore there are at most disjoint dominating sets.
Near sets are disjoint sets that resemble each other.
If and then there exists a finite number of mutually disjoint sets for such that .
A property is called additive if it is closed under taking disjoint union of graphs.
Thus, two trapezoids are disjoint exactly if their corresponding boxes are comparable.
The terminals and nonterminals of a particular grammar are two disjoint sets.
Consequently, to get the yet disjoint parts of the syntax, expressions and types together meaningfully, a third part, the context is needed.
Alias classes are disjoint sets of locations that cannot alias to one another.
These are disjoint sets, and by formula (1)
Songs that have more than one of these characteristics are quite rare, so his songs form three quite disjoint sets.
Then there is the second concept Phase that is also be divided two sub concepts with a complete and disjoint ordering.
If one excludes currency from the definitions, the monetary base is not a subset of the money supply - rather, the two are disjoint sets.
Let , and be non-empty and disjoint sets.
This can create a disjoint set which can impede the efficiency of a torrent to transfer the files it describes.
The unions are disjoint unions.
Of course, pairs of probes that have been hybridised to mutually disjoint libraries cannot cannot be compared in this way.
The two separate, disjoint institutions are using the same name, in Priština and Mitrovica.
A cut in an undirected graph is a partition of the vertices into two non-empty, disjoint sets .