A short proof of a difficult theorem of P.D. Seymour on grafts with the max-flow min-cut property is given.

AIMS To increase the sensitivity of an automated chlamydia enzyme immunoassay by significantly lowering its cut off value, and to maintain specificity by confirmation with polymerase chain reaction (PCR) and direct immunofluorescent antibody test (DFA). METHODS Over five months, the cut off value of the enzyme immunoassay used to screen urogenital samples for chlamydia antigen was reduced fro...

In this study, the influence of cutting parameters and machining time on tool wear surface roughness was investigated in high-speed milling process Al6061 using face carbide inserts. Taguchi experimental matrix (L9) chosen to design conduct research with three input (feed rate, speed, axial depth cut). Tool (VB) (Ra) after different strokes (after 10, 30, 50 strokes) were selected as output par...

We study budgeted variants of classical cut problems: the Multiway Cut problem, the Multicut problem, and the k-Cut problem, and provide approximation algorithms for these problems. Specifically, for the budgeted multiway cut and the k-cut problems we provide constant factor approximation algorithms. We show that the budgeted multicut problem is at least as hard to approximate as the sparsest c...

We propose Inflate-Paste – a new technique for generating orthogonal polygons with a given number of vertices from a unit square based on gluing rectangles. It is dual to Inflate-Cut – a technique we introduced in [12] that works by cutting rectangles.

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 ...

Luca Trevisan [1] presented an approximation algorithm for Max Cut based on spectral partitioning techniques. He proved that the algorithm has an approximation ratio of at least 0.531. We improve this bound up to 0.6142. We also define and extend this result for the more general Maximum Colored Cut problem.