We propose a preprocessing algorithm for the multiway cut problem that establishes its polynomial kernelizability when the difference between the parameter k and the size of the smallest isolating cut is at most log(k). To the best of our knowledge, this is the first progress towards kernelization of the multiway cut problem. We pose two open questions that, if answered affirmatively, would imp...

Background: We investigated whether the lungheart ratio parameter (LHR) can be used to identify the optimum cut off frequency for Butterworth filter in 99mTc myocardial SPECT imaging. Materials and Methods: This study involved a cardiac phantom system consisting of cardiac insert in which 1.10 cm cold defect was inserted into its myocardium wall and filled with 4.0 μCi/ml (0.148 MBq/ml...

Extended Abstract. Sampling is the process of selecting units (e.g., people, organizations) from a population of interest so that by studying the sample we may fairly generalize our results back to the population from which they were chosen. To draw a sample from the underlying population, a variety of sampling methods can be employed, individually or in combination. Cut-off sampling is a pr...

In this paper, the outage performance of wireless networks with unstructured topologies is investigated. The network reliability perspective graph theory used to obtain polynomial generalized for both uncorrelated and correlated channels. A relationship established between max-flow min-cut theo...

This paper presents a general analytical model for studying the effect of cut-through switching on buffered MIN (multistage interconnection network) switches. We consider two types of MIN switches: input-buffered MIN and output-buffered MIN. Previous studies of cut-through switching assumed the use of 2 × 2 switching elements as a building block for the MIN; and they are not applicable to MINs ...

A graph G is equimatchable if any matching of G is a subset of a maximum-size matching. From a general description of equimatchable graphs in terms of GallaiEdmonds decomposition [Lesk, Plummer, and Pulleyblank, "Equimatchable graphs", Graphs Theory and Combinatorics, Academic press, London, (1984) 239-254.] it follows that any 2-connected equimatchable graph is either bipartite or factor-criti...

We give a semantic account of the execution time (i.e. the number of cut-elimination steps leading to the normal form) of an untyped MELL (proof-)net. We first prove that: 1) a net is head-normalizable (i.e. normalizable at depth 0) if and only if its interpretation in the multiset based relational semantics is not empty and 2) a net is normalizable if and only if its exhaustive interpretation ...

Given an undirected, capacitated graph G = (V,E) and a set K ⊂ V of terminals of size k, we construct an undirected, capacitated graph G′ = (K,E′) for which the cut-function approximates the value of every minimum cut separating any subset U of terminals from the remaining terminals K −U . We refer to this graph G′ as a cut-sparsifier, and we prove that there are cut-sparsifiers that can approx...