By a classical result of Gomory and Hu (1961), in every edgeweighted graph G = (V,E,w), the minimum st-cut values, when ranging over all s, t ∈ V , take at most |V |−1 distinct values. That is, these (|V | 2 ) instances exhibit redundancy factor Ω(|V |). They further showed how to construct from G a tree (V,E′, w′) that stores all minimum st-cut values. Motivated by this result, we obtain tight...

Size, shape, volume fraction and distribution of embedded g/ phase in g phase has direct effect on strength of INCONEL alloy. Microstructure parameters of INCONEL phases are quantified from microstructure images using transmission electron microscopy (TEM). Different TEM sample preparation techniques were used to study INCONEL 738 alloy microstructure for transmission electron micros...

‎A $mu$-way $(v,k,t)$ $trade$ of volume $m$ consists of $mu$‎ ‎disjoint collections $T_1$‎, ‎$T_2‎, ‎dots T_{mu}$‎, ‎each of $m$‎ ‎blocks‎, ‎such that for every $t$-subset of $v$-set $V$ the number of‎ ‎blocks containing this t-subset is the same in each $T_i (1leq‎ ‎i leq mu)$‎. ‎In other words any pair of collections ${T_i,T_j}$‎, ‎$1leq i< j leq mu‎$ is a $(v,k,t)$ trade of volume $m$. In th...

We study the problem of finding a small sparse cut in an undirected graph. Given an undirected graph G = (V,E) and a parameter k ≤ |E|, the small sparsest cut problem is to find a set S ⊆ V with minimum conductance among all sets with volume at most k. Using ideas developed in local graph partitioning algorithms, we obtain the following bicriteria approximation algorithms for the small sparsest...

Objective- To compare transabdominal (TA) and transrectal (TR) ultrasonography of the prostate gland. Design- Experimental study. Animals- 10 intact male dogs that required euthanasia for reasons other than prostatic disease. Procedures- Prostatic length (L), width (W) and height (H) were measured in T A (L1, W1 and H1) and TR (L2 and H2...

We study the problem of finding a small sparse cut in an undirected graph. Given an undirected graph G = (V,E) and a parameter k ≤ |E|, the small sparsest cut problem is to find a set S ⊆ V with minimum conductance among all sets with volume at most k. Using ideas developed in local graph partitioning algorithms, we obtain the following bicriteria approximation algorithms for the small sparsest...

BACKGROUND It is generally accepted that peritoneal dialysis (PD) affects systemic haemodynamics less than haemodialysis, but little is known about changes in haemodynamics during PD. It is unknown if increasing PD volume causes changes in cardiovascular haemodynamics possibly increasing the demand on the heart even during normal daily activities. METHODS Fifteen stable PD patients were inclu...