A graph G is signed if each edge is assigned + or −. A signed graph is balanced if there is a bipartition of its vertex set such that an edge has sign − if and only if its endpoints are in different parts. The Edwards-Erdös bound states that every graph with n vertices and m edges has a balanced subgraph with at least m 2 +n−1 4 edges. In the Signed Max Cut Above Tight Lower Bound (Signed Max C...

Restricted edge connectivity is a more refined network reliability index than edge connectivity. A restricted edge cut F of a connected graph G is an edge cut such that G−F has no isolated vertex. The restricted edge connectivity λ′ is theminimumcardinality over all restricted edge cuts.WecallG λ′-optimal if λ′ = ξ , where ξ is theminimum edgedegree inG. Moreover, a λ′-optimal graphG is called ...

A graph G is signed if each edge is assigned + or −. A signed graph is balanced if there is a bipartition of its vertex set such that an edge has sign − if and only if its endpoints are in different parts. The Edwards-Erdös bound states that every graph with n vertices and m edges has a balanced subgraph with at least m 2 +n−1 4 edges. In the Signed Max Cut Above Tight Lower Bound (Signed Max C...

The response of ground-dwelling spider assemblages to edges created by wildfire was compared to their response to clear-cut edges in black spruce forests in eastern Canada. For each disturbance six edge transects 100 m long were established. Spiders were collected with pitfall traps 10 m apart from 50 m inside the disturbances to 50 m in the forest interior. Measurements of the forest floor str...

Given a graph with non-negative edge weights, the MAXCUT problem is to partition the set of vertices into two subsets so that the sum of the weights of edges with endpoints in different subsets is maximized. This classical NP-hard problem finds applications in VLSI design, statistical physics, and classification among other fields. This paper compares the performance of several greedy construct...

In this paper we present a graph cuts based active contours (GCBAC) approach to object segmentation. GCBAC approach is a combination of the iterative deformation idea of active contours and the optimization tool of graph cuts. It differs from traditional active contours in that it uses graph cuts to iteratively deform the contour and its cost function is defined as the summation of edge weights...

Let P be a set of n points in general position in the plane which is partitioned into color classes. P is said to be color-balanced if the number of points of each color is at most bn/2c. Given a color-balanced point set P , a balanced cut is a line which partitions P into two colorbalanced point sets, each of size at most 2n/3+1. A colored matching of P is a perfect matching in which every edg...

In the present work, KTP crystals have been grown by spontaneous nucleation technique in flux medium using K6P4O13 flux. 0.4-1 °C/h cooling rates were applied in the spontaneous nucleation process. The presence and amount of impurities has been determined by using XRF. The optical transmission spectra of impure KTP crystals in the UV–visible region are discussed. The transmission cut-off is cle...