نتایج جستجو برای: cut

تعداد نتایج: 73885  

Journal: :Annals OR 2017
Fuda Ma Jin-Kao Hao

The max-k-cut problem is to partition the vertices of a weighted graph G = (V, E) into k ≥ 2 disjoint subsets such that the weight sum of the edges crossing the different subsets is maximized. The problem is referred as the max-cut problem when k = 2. In this work, we present a multiple operator heuristic (MOH) for the general max-k-cut problem. MOH employs five distinct search operators organi...

Journal: :journal of ornamental plants 2015
iftikhar ahmad muhammad aslam khan muhammad qasim rashid ahmad tauseef us-samad

the effects of sodium chloride (nacl) salinity (control; canal water with 0.4 ds m-1), 2.5 dsm-1, 5.0 ds m-1, 7.5 ds m-1 and 10.0 ds m-1, respectively) developed after 6 weeks of pruning (beginning of study) on plant growth, flowering and quality of three cut rose (rosa hybrida l.) cultivars viz. ‘kardinal’, ‘angelique’ and ‘gold medal’ were studied to achieve better management, quality product...

Journal: :iranian journal of fuzzy systems 2004
kiran r. bhutani john mordeson azriel rosenfeld

the notion of strong arcs in a fuzzy graph was introduced bybhutani and rosenfeld in [1] and fuzzy end nodes in the subsequent paper[2] using the concept of strong arcs. in mordeson and yao [7], the notion of“degrees” for concepts fuzzified from graph theory were defined and studied.in this note, we discuss degrees for fuzzy end nodes and study further someproperties of fuzzy end nodes and fuzz...

2016
Kurt Mehlhorn

Throughout this section, G = (V,E) is a multi-graph. A cut of G is a bipartition (S, S̄) of the vertex set of G. The capacity of a cut is the number of edges having one endpoint on both sides of the cut. A min-cut is a cut of minimum capacity. A minimum cut can be computed with the help of maxflow computations. For some vertex s and every other vertex t, one computes the minimum cut separating s...

2010
Stefan Hetzl

Cut-elimination is usually presented as a set of local proof reduction steps together with a terminating strategy thus showing the existence of cut-free proofs for all provable sequents. Viewing cut-elimination as a transformation of mathematical proofs, not only the existence but also the structure and content of the cut-free proofs deserves investigation. In this paper we use proof skeletons ...

Journal: :The practising midwife 1993
Sharon Phillips

acres, and you enjoy a variety of activities on your land: watching wildlife, hiking, hunting, picking berries, picnicking or taking photos of wildlife and wildflowers. You delight in the beauty and solitude that comes with owning a woodland. You warm yourself in late fall and winter by cutting a little firewood, and you wouldn’t mind making a little extra cash, though managing your woodland fo...

Journal: :Kaleidoscope History 2014

Journal: :Nature 2007

Journal: :Nature Reviews Cancer 2006

Journal: :PhotonicsViews 2020

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید