-
1 biconnected
BiconnectedБольшой англо-русский и русско-английский словарь > biconnected
-
2 biconnected
-
3 biconnected
Математика: бисвязный -
4 biconnected
-
5 biconnected
бисвязный, двусвязный -
6 biconnected graph
двусвязный графАнглийский-русский словарь по теории вероятностей, статистике и комбинаторике > biconnected graph
-
7 biconnected component
Теория графов: двусвязный компонент -
8 biconnected domain
Математика: двусвязная область -
9 biconnected graph
1) Математика: двусвязный граф2) Вычислительная техника: граф без сочленений, граф без точек сочленения -
10 biconnected set
Математика: бисвязное множество -
11 biconnected space
Математика: бисвязное пространство -
12 biconnected component
т. граф. двусвязный компонентEnglish-Russian dictionary of computer science and programming > biconnected component
-
13 biconnected graph
двусвязный граф; граф без точек сочлененияEnglish-Russian dictionary of computer science and programming > biconnected graph
-
14 biconnected graph
• dvostruko povezan graf -
15 biconnected graph
Англо-русский словарь компьютерных и интернет терминов > biconnected graph
-
16 biconnected graph
English-Russian dictionary of terms that are used in computer games > biconnected graph
-
17 biconnected domain
мат. -
18 biconnected set
мат. -
19 biconnected space
-
20 biconnected component
См. также в других словарях:
Biconnected component — Each color corresponds to a biconnected component. Multi colored vertices are cut vertices, and thus belong to multiple biconnected components. In graph theory, a biconnected component (or 2 connected component) is a maximal biconnected subgraph … Wikipedia
Biconnected graph — In the mathematical discipline of graph theory, a biconnected graph is a connected graph with no articulation vertices.In other words, a biconnected graph is nonseparable, meaning if any vertex were to be removed, the graph will remain… … Wikipedia
biconnected — adjective Describing a connected graph in which two vertices must be removed for it to become disconnected … Wiktionary
Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… … Wikipedia
Outerplanar graph — A maximal outerplanar graph and its 3 coloring. In graph theory, an undirected graph is an outerplanar graph if it can be drawn in the plane without crossings in such a way that all of the vertices belong to the unbounded face of the drawing.… … Wikipedia
Cycle double cover — Unsolved problems in mathematics Does every bridgeless graph have a multiset of cycles covering every edge exactly twice? … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
List of mathematics articles (B) — NOTOC B B spline B* algebra B* search algorithm B,C,K,W system BA model Ba space Babuška Lax Milgram theorem Baby Monster group Baby step giant step Babylonian mathematics Babylonian numerals Bach tensor Bach s algorithm Bachmann–Howard ordinal… … Wikipedia
Cactus graph — A cactus graph (sometimes called a cactus tree) is a connected graph in which any two simple cycles have at most one vertex in common. Equivalently, every edge in such a graph may belong to at most one cycle.Cactus graphs were first studied under … Wikipedia
Список терминов, относящихся к алгоритмам и структурам данных — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не устанавливается на информационные списки и глоссарии … Википедия