cut vertex
11Список терминов — Список терминов, относящихся к алгоритмам и структурам данных   Это сл …
12Biconnected 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 …
13Bridge (graph theory) — A graph with 6 bridges (highlighted in red) An undirected connected graph with no cut …
14List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… …
15Gelenkpunkt (Graphentheorie) — Ein ungerichteter Graph mit n=5 Knoten und 3 Gelenkpunkten (rot markiert) …
16точка сочленения связного графа — — [Л.Г.Суменко. Англо русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.] Тематики информационные технологии в целом EN cut vertex …
17Method of conditional probabilities — In mathematics and computer science, the probabilistic method is used to prove the existence of mathematical objects with desired combinatorial properties. The proofs are probabilistic they work by showing that a random object, chosen from some… …
18Closure problem — A Closure problem is a problem in graph theory for finding a set of vertices in a directed graph such that there are no edges from the set to the rest of the graph. More specifically, the minimum closure problem asks for a set of this type with… …
19Parabola — For other uses, see Parabola (disambiguation). A parabola …
202-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… …
