In this paper a new approximation algorithm for calculating the min-cut tree of an undirected edgeweighted graph has been proposed. This algorithm runs in 2 2 ( .log . ) O V V V d  , where V is the number of vertices in the given graph and d is the degree of the graph. It is a significant improvement over time complexities of existing solutions. However, because of an assumption it does not pr...

We construct exact classical solutions in cubic open string field theory. By the redefinition of the string field, we find that the solutions correspond to finite deformations of the Wilson lines. The solutions are well-defined in level truncation scheme, and they have no branch cut singularity of marginal parameters which was found in the analysis using level truncation approximation in Feynma...

Multi-label classification is more general in practice because it allows one instance to have more than one label simultaneously. In this paper, we focus on one type of multilabel classification in that there exist constraints among the labels. We formulate this kind of multi-label classification into a minimum cut problem, where all labels and their correlations are represented by a weighted g...

In this paper, we discuss the convergence property of the discrete Hopfield-type neural network (DHNN) running in asynchronous mode. Then a DHNN with negative diagonal weight matrix is designed to solve the Max-Cut problem, which can approach good solutions.

Combinatorial min-cut algorithms on graphs emerged as an increasingly useful tool for problems in vision. Typically, the use of graphcuts is motivated by one of the following two reasons. Firstly, graph-cuts allow geometric interpretation; under certain conditions a cut on a graph can be seen as a hypersurface in N-D space embedding the corresponding graph. Thus, many applications in vision and...

Branch-and-bound and branch-and-cut use search trees to identify optimal solutions. In this paper, we introduce a linear search strategy which we refer to as cut-and-solve and prove optimality and completeness for this method. At each node in the search path, a relaxed problem and a sparse problem are solved and a constraint is added to the relaxed problem. The sparse problems provide incumbent...

We explicitly demonstrate that the known solutions for expanding impulsive spherical gravitational waves that have been obtained by a “cut and paste” method may be considered to be impulsive limits of the Robinson–Trautman vacuum type N solutions. We extend these results to all the generically distinct subclasses of these solutions in Minkowski, de Sitter and anti-de Sitter backgrounds. For the...

The paper examines the combination the conventional heuristic of COP generation and Genetic algorithm (GA) to optimize Cut order plan (COP) solutions in apparel industry. Cut planners in apparel organizations need to decide the cut templates of fabric cutting when the cut order requirement is known. As NP-hard problem with several constrains, COP requires a high speed processing algorithm to fi...

In this paper we analyze a known relaxation for the Sparsest Cut Problem based on positive semidefinite constraints, and we present a branch and bound algorithm and heuristics based on this relaxation. The relaxed formulation and the algorithms were tested on small and moderate sized instances. It leads to values very close to the optimum solution values. The exact algorithm could obtain soluti...

Cut flowers have become an export income in the global floriculture market. They multiple uses, such as for home beautification, ceremonies (including weddings and funerals), symbols of love, appreciation, respect, etc., humane society. Each type cut flower has a different vase life longevity their freshness is linked to preharvest, harvest, postharvest tools conditions. The quality must be con...