An elegant and general way to apply graph partitioning algorithms to hypergraphs would be to model hypergraphs by graphs and apply the graph algorithms to these models Of course such models have to simulate the given hypergraphs with respect to their cut properties An edge weighted graph V E is a cut model for an edge weighted hypergraph V H if the weight of the edges cut by any bipartition of ...

We consider the Steiner k-cut problem which generalizes both the k-cut problem and the multiway cut problem. The Steiner k-cut problem is defined as follows. Given an edge-weighted undirected graph G = (V,E), a subset of vertices X ⊆ V called terminals, and an integer k ≤ |X|, the objective is to find a minimum weight set of edges whose removal results in k disconnected components, each of whic...

The goal of this study was to evaluate real-time volumetric and dosimetric changes of the parotid gland so as to determine replanning criteria and timing for parotid protection-based adaptive radiation therapy in nasopharyngeal carcinoma. Fifty NPC patients were treated with helical tomotherapy; volumetric and dosimetric (D mean, V 1, and D 50) changes of the parotid gland at the 1st, 6th, 11th...

BACKGROUND Current therapeutic standard for locally advanced rectal cancer is the neoadjuvant radiochemotherapy with total mesorectal excision. Diarrhoea is the main acute side effect, induced by the dose to the small-bowel, frequently leading to a treatment modification. Aim of this study was to analyse the differences between the irradiated small-bowel volumes and the occurrence of acute diar...

Poljak, S. and D. Turzik, Max-cut in circulant graphs, Discrete Mathematics 108 (1992) 379-392. We study the max-cut problem in circulant graphs C,,,, where C,,, is a graph whose edge set consists of a cycle of length n and all the vertex pairs of distance r on the cycle. An efficient solution of the problem is obtained so that we show that there is always a maximum cut of a particular shape, c...

For a positive integer d, the d-CUT is problem of deciding if an undirected graph $$G=(V,E)$$ has nontrivial bipartition (A, B) V such that every vertex in A (resp. at most d neighbors B A). When $$d=1$$ , this MATCHING CUT problem. Gomes and Sau [9] gave first fixed-parameter tractable algorithm for parameterized by maximum number crossing edges cut (i.e., size edge cut). However, their paper ...

The effects of proximal gastric vagotomy (PGV) and vagotomy with pyloroplasty (V and P) on gastric motility were studied using a solid meal labelled with a radiopharmaceutical agent. In having on-line computer facilities it was possible not only to record the rate of emptying but also to analyse the relative roles of the fundus and the antrum within the overall framework of gastric emptying. In...

Charge movement was measured in frog cut twitch fibers with the double Vaseline gap technique. Five manipulations listed below were appl ied to investigate their effects on the hump component (Iv) in the ON segments of TEST minus CONTROL current traces. When external CIwas replaced by MeSO~ to eliminate CI current, I v peaked earlier due to a few millivolts shift of the voltage dependence of I ...

A graft is a graph G = (V,E) together with a set T ⊆ V of even cardinality. A T-cut of G is an edge cut δ(X) for which |X ∩T | is odd. A T-join of G is a set of edges S ⊆ E with the property that a vertex of the graph (V, S) has odd degree if and only if it is in T . A T-join packing of G is a set of pairwise disjoint T-joins. Let τ(G) be the size of the smallest T-cut of G and let ν(G) be the ...