Примеры использования Maximum degree на Английском языке и их переводы на Русский язык
{-}
-
Official
-
Colloquial
The regular participation of the Director of UNSD in the meetings of the Bureau ensures that a maximum degree of coordination takes place regarding all activities under the responsibility of UNSD.
pressure in terms of temperature increase, maximum degree of filling.
Confocal optical scheme allows to achieve the maximum degree of detail while maintaining a high speed of image acquisition.
volume in terms of temperature increase and maximum degree of filling.
At the maximum degree of hydration, 2/3 of the thread mass is water which is bound within the main amorphous matrix 22.
there exist planar graphs of maximum degree ranging from two through five that are of class two.
So, any data gets the maximum degree of protection and anonymity,
It turns out that the total coloring version of maximum degree upper bound is a difficult problem
For planar graphs with maximum degree Δ≥ 7, the optimal number
Two of the coagulants studied were selected that could ensure the maximum degree of water clarification at the minimum concentration of residual aluminium and permanganate value in drinking water.
In contrast, he observed that for any maximum degree in the range from two to five, there exist planar graphs of class two.
states that every multigraph with maximum degree Δ{\displaystyle\Delta} and multiplicity μ{\displaystyle\mu}
Two of the flocculants studied were selected that could ensure the maximum degree of water clarification at the minimum concentration of residual aluminium,
in terms of the maximum degree Δ(G) of G include the following: A(G)≤ 4 if Δ(G) 3.
For graphs of maximum degree three, a careful backtracking search can find a Hamiltonian cycle(if one exists)
For our customers, this not only means a maximum degree of certainty, but also guarantees the accuracy information of all flowmeters under reference conditions.
Here, a linear forest is an acyclic graph with maximum degree two, i.e., a disjoint union of path graphs.
The United Kingdom is committed to the maximum degree of transparency about our nuclear and fissilematerial stockpiles compatible
Equivalently(because the Petersen graph has maximum degree three) every snark has a subgraph that can be formed from the Petersen graph by subdividing some of its edges.
In the case of bipartite graphs or multigraphs with maximum degree Δ, the optimal number of colors is exactly Δ.