cut set - перевод на русский
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

cut set - перевод на русский

IN GRAPH THEORY, PARTITION OF THE VERTICES IN TWO SETS
Size of the cut; Cut set; Graph-cut; Cutset; Minimum vertex cut; Sparsest cut; Sparsest Cut; Sparsest cut problem; S-t cut; Cut space
  • A maximum cut.
  • A minimum cut.

cut set         

математика

секущее множество

разрез

сечение

cut space         

математика

пространство сечений

cut-glass         
  • Contemporary Czech cut glass in two colours
  • Czech glass-cutter at work
  • Chandelier in the chapel of [[Emmanuel College, Cambridge]], donated in 1732, one of the earliest datable cut glass examples.  The shape follows contemporary brass examples, with glass branches but no "drops"; only the pieces down the stem are cut, mostly with flat facets.<ref>Battie & Cottle, 102</ref>
  • American "brilliant cut" [[punch bowl]] on stand, 1895
  • Montgolfier]]" shape (due to its resemblance to an inverted [[hot air balloon]]),<ref>History</ref> in [[Edinburgh]]
  • Regency]] chandeliers in [[Saltram House]], England
  • [[Waterford Crystal]] factory in 2001
  • engraving]] above, England, late 18th-century
GLASS DECORATED WITH GEOMETRICAL OR REPRESENTATIONAL INCISIONS MADE BY GRINDING AND POLISHING
Cut-glass accent; Cut-glass; Cut crystal

существительное

общая лексика

граненое стекло

Определение

кодировка
ж.
То же, что: кодирование.

Википедия

Cut (graph theory)

In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets. Any cut determines a cut-set, the set of edges that have one endpoint in each subset of the partition. These edges are said to cross the cut. In a connected graph, each cut-set determines a unique cut, and in some cases cuts are identified with their cut-sets rather than with their vertex partitions.

In a flow network, an s–t cut is a cut that requires the source and the sink to be in different subsets, and its cut-set only consists of edges going from the source's side to the sink's side. The capacity of an s–t cut is defined as the sum of the capacity of each edge in the cut-set.

Как переводится cut set на Русский язык