نتایج جستجو برای: its cut
تعداد نتایج: 2010538 فیلتر نتایج به سال:
London, British Library Additional MS 39564 is an anonymous collection of English lessons for the two-hand sword, tentatively dated to first quarter sixteenth century. This manuscript peculiar in several ways, aside from it being one only three such texts known scholars. paper discusses two aspects this that speak its origins and survival present form. The appear be out order while there no cha...
The worst-case complexity of cut elimination in sequent calculi for first order based logics is investigated in terms of the increase in logical depth of the deduction. It is shown that given a calculus satisfying a general collection of sufficient conditions for cut elimination and given a deduction with cuts, there exists a cut free deduction with a logical depth, in the worst case, hyper-exp...
We describe deterministic and randomized algorithms for finding global minimum cuts in undirected graphs. 1 Global and s-t cuts in undirected graphs Let G = (V,E,w) be a weighted undirected graph, where w : E → R is a weight (or cost, or capacity) function defined on its edges. A (global) cut {S, T} of G is a partition of V into two disjoint non-empty sets, i.e., S, T 6= φ and S ∩ T = φ. Edges ...
Let S be a cut of a simple connected graph G. If S has no proper subset that is a cut, we say S is a minimal cut of G. To a minimal cut S, a connected component of G − S is called a fragment. And a fragment with no proper subset that is a fragment is called an end. In the paper ends are characterized and it is proved that to a connected graph G = (V, E), the number of its ends Σ ≤ |V (G)|.
A graph is subcubic if its maximum degree is at most 3. The bipartite density of a graph G is defined as b(G) = max{|E(B)|/|E(G)| : B is a bipartite subgraph of G}. It was conjectured by Bondy and Locke that if G is a triangle-free subcubic graph, then b(G) ≥ 45 and equality holds only if G is in a list of seven small graphs. The conjecture has been confirmed recently by Xu and Yu. This note gi...
We compute a complete linear description of the bipartite subgraph polytope, for up to seven nodes, and a conjectured complete description for eight nodes. We then show how these descriptions were used to compute the integrality ratio of various relaxations of the max-cut problem, again for up to eight nodes.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید