Examples of using Partial order in English and their translations into Russian
{-}
-
Official
-
Colloquial
describe the same partial order.
a set of mutually incomparable elements) equals the minimum number of chains(totally ordered subsets) into which the partial order may be partitioned.
form a partial order on the vertices of G in which u<
the order dimension of a partially ordered set is the least number of total orders on the same set of elements whose intersection is the given partial order.
The order dimension of a partial order P is the minimum size of a realizer of P,
then the Bruhat order is a partial order on the group W. Recall that a reduced word for an element w of W is a minimal length expression of w as a product of elements of S,
It is straightforward to verify that the graph minor relation forms a partial order on the isomorphism classes of undirected graphs: it is transitive(a minor of a minor of G is a minor of G itself),
Based on this two-dimensional partial order property, every st-planar graph can be given a dominance drawing, in which for every two vertices u
Not all asymmetric relations are strict partial orders.
There is a partial ordering on the set of all numberings.
Containment of one Young diagram in another defines a partial ordering on the set of all partitions,
The binary relation⊆ defines a partial ordering relation on the set of all possible topologies on X. The finest topology on X is the discrete topology;
A vector clock is an algorithm for generating a partial ordering of events in a distributed system
therefore directed sets are not always partial orders.
A pointed and salient convex cone C induces a partial ordering"≤" on V,
However, some partial orders of dimension two and with one minimal
A P node of a PQ tree allows all possible orderings of its children, like a parallel composition of partial orders, while a Q node requires the children to occur in a fixed linear ordering, like a series composition of partial orders. .
Deactivating hedging allows you to quickly execute partial order closing as well.
the width of this partial order is n.
In particular→ is a partial order on equivalence classes of directed graphs.