The maximum cut problem this paper deals with can be formulated as follows. Given an undirected simple graph G = (V,E) where V and E stand for the node and edge sets respectively, and given weights assigned to the edges: (wij)ij∈E , a cut δ(S), with S ⊆ V is de ned as the set of edges in E with exactly one endnode in S, i.e. δ(S) = {ij ∈ E | |S ∩ {i, j}| = 1}. The weight w(S) of the cut δ(S) is...

Technology has been going rapidly through the years, and BIM is one of massive developments that offer some benefits for construction industry. widely used in building project started to be infrastructure projects such as toll roads. In a road project, cut fill volumes, which consume lot time calculate quantity high chance human error. This research aims determine implementation take-off Toll R...

For a connected graph G = (V , E), a subset U ⊆ V is a disconnected cut if U disconnects G and the subgraph G[U] induced by U is disconnected as well. A cut U is a k-cut if G[U] contains exactly k(≥ 1) components. More specifically, a k-cut U is a (k, l)-cut if V \ U induces a subgraph with exactly l(≥ 2) components. The Disconnected Cut problem is to testwhether a graph has a disconnected cut ...

Given a graph G = (V;E), a weight function w : E ! R+ and a parameter k we examine a family of maximization problems arising naturally when considering a subset U V of size exactly k. Speci cally we consider the problem of nding a subset U V of size k that maximizes : Max-k-Vertex Cover : the weight of edges incident with vertices in U . Max-k-Dense Subgraph : the weight of edges in the subgrap...

Numerical investigation of the heat transfer and friction factor characteristics of a circular fitted with V-cut twisted tape (VCT) insert with twist ratio (y = 2.93) and different cut depths (w = 0.5, 1, and 1.5 cm) were studied for laminar flow using CFD package (FLUENT-6.3.26). The data obtained from plain tube were verified with the literature correlation to ensure the validation of simulat...

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...

the selection of a growing medium is one of the most important decisions in the culture of hydroponic crops. in order to select a suitable medium for hydroponic cucumber (cucumis sativus l. cv. negin), an experiment was carried out on growing media containing different particle sizes of perlite and organic substrates in a run-to-waste system in a greenhouse experiment. the growing media tested ...

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 ...

In this paper we have discussed all existing approaches to solve the problem for calculating the min-cut tree of an undirected edge-weighted graph and present a new approximation algorithm for constructing the minimum-cut tree. We discussed Gomory-Hu algorithm. The algorithm proposed by Gomory and Hu has time complexity O(V*time complexity of finding a min s-t cut). We also have discussed Ford-...

In the problem (Unweighted) Max-Cut we are given a graph $$G = (V,E)$$ and asked for set $$S \subseteq V$$ such that number of edges from S to $$V \setminus S$$ is maximal. this paper consider an even harder problem: (Weighted) Max-Bisection. Here undirected weight function $$w :E \rightarrow \mathbb {Q}_{>0}$$ task find (i) sum weights maximal; (ii) contains $$\lceil * \rceil {\frac{n}{2}}$$ v...