Graph cut minimization formulates the segmentation problem as the liner combination of data and smoothness terms. The smoothness term is included in the energy formulation through a regularization parameter. We propose that the trade-off between the data and the smoothness terms should not be balanced by the same regularization parameter for the whole image. In order to validate the proposed id...

a signed graph (marked graph) is an ordered pair $s=(g,sigma)$$(s=(g,mu))$, where $g=(v,e)$ is a graph called the underlyinggraph of $s$ and $sigma:erightarrow{+,-}$$(mu:vrightarrow{+,-})$ is a function. for a graph $g$, $v(g),e(g)$ and $c(g)$ denote its vertex set, edge set and cut-vertexset, respectively. the lict graph $l_{c}(g)$ of a graph $g=(v,e)$is defined as the graph having vertex set ...

Min-k-cut is the problem of partitioning vertices of a given graph or hypergraph into k subsets such that the total weight of edges or hyperedges crossing different subsets is minimized. For the capacitated min-k-cut problem, each edge has a nonnegative weight, and each subset has a possibly different capacity that imposes an upper bound on its size. The objective is to find a partition that mi...

In the scope of discrete finite-state models of interacting components, we present a novel algorithm for identifying sets of local states of components whose activity is necessary for the reachability of a given local state. If all the local states from such a set are disabled in the model, the concerned reachability is impossible. Those sets are referred to as cut sets and are computed from a ...

In this study, turning operation of Monel K500 copper-nickel super-alloy was evaluated. Ceramic cutting tools with two different cutting noses (conventional and wiper) were utilized. At first, the experimental tests were designed by using central composite design method. After implementation of the tests, the statistical models for output data (surface roughness, cutting force, and flank wear) ...

Three methods are investigated to remove the concavity at the boundary edges and/or vertices during polyhedral mesh generation by a dual mesh method. The non-manifold elements insertion method is the first method examined. Concavity can be removed by inserting non-manifold surfaces along the concave edges and using them as an internal boundary before applying Delaunay mesh generation. Conical c...

A fuzzy graph is a symmetric binary fuzzy relation on a fuzzy subset. The concept of fuzzy sets and fuzzy relations was introduced by L.A.Zadeh in 1965cite{zl} and further studiedcite{ka}. It was Rosenfeldcite{ra} who considered fuzzy relations on fuzzy sets and developed the theory of fuzzy graphs in 1975. The concepts of fuzzy trees, blocks, bridges and cut nodes in fuzzy graph has been studi...

We present a deterministic incremental algorithm for exactly maintaining the size of a minimum cut with Õ(1) amortized time per edge insertion and O(1) query time. This result partially answers an open question posed by Thorup [Combinatorica 2007]. It also stays in sharp contrast to a polynomial conditional lower-bound for the fully-dynamic weighted minimum cut problem. Our algorithm is obtaine...

We address the following problem: given an undirected graph G = (V,E), with vertex set V of cardinality n and edge set E, where each edge (i, j) has a non-negative integer weight wij , and given a constant B, 0 ≤ B < n, find a cut (S, V \ S) of G of maximum weight such that the difference between the cardinalities of the two shores of the cut is not greater than B. This problem has been introdu...

The Small Set Expansion Hypothesis is a conjecture which roughly states that it is NP-hard to distinguish between a graph with a small subset of vertices whose (edge) expansion is almost zero and one in which all small subsets of vertices have expansion almost one. In this work, we prove conditional inapproximability results with essentially optimal ratios for the following graph problems based...