Many hard graph problems, such as Hamiltonian Cycle, become FPT when parameterized by treewidth, a parameter that is bounded only on sparse graphs. When parameterized by the more general parameter cliquewidth, Hamiltonian Cycle becomes W[1]-hard, as shown by Fomin et al. [5]. Sæther and Telle address this problem in their paper [13] by introducing a new parameter, split-matching-width, which li...

Definition 1.1. Given a (undirected) graph G = (V,E), the maximum cut δ(U) for U ⊆ V is the cut with maximal value |δ(U)|. The Maximum Cut Problem consists of finding a maximal cut. We let MaxCut(G) = max{|δ(U)| : U ⊆ V } be the value of the maximum cut in G, and MaxCut′ = MaxCut(G) |E| be the normalized version (note that both normalized and unnormalized maximum cut values are induced by the s...

  Abstract   Background : Although, different studies on end-to-side nerve repair, results are controversial. The importance of this method in case is unavailability of proximal nerve. In this method, donor nerves also remain intact and without injury. In compare to other classic procedures, end-to-side repair is not much time consuming and needs less dissection. Overall, the previous studies i...

This note investigates the boundary between polynomially-solvable Max Cut and NP Hard Max Cut instances when they are classified only on the basis of the sign pattern of the objective function coefficients, i.e., of the orthant containing the objective function vector. It turns out that the matching number of the subgraph induced by the positive edges is the key parameter that allows us to diff...

A general assumption made in evaluation of flow network reliability is perfectly reliable nodes. Under such assumption, network reliability is evaluated through subset cut or composite path set approaches. This paper presents a simple approach to account for node failures in reliability evaluation of flow networks using subset cut approach. The proposed approach starts with generating combinati...

Cut-elimination is the most prominent form of proof transformation in logic. The elimination of cuts in formal proofs corresponds to the removal of intermediate statements (lemmas) in mathematical proofs. The cut-elimination method CERES (cut-elimination by resolution) works by constructing a set of clauses from a proof with cuts. Any resolution refutation of this set then serves as a skeleton ...

abstract   background : although, different studies on end-to-side nerve repair, results are controversial. the importance of this method in case is unavailability of proximal nerve. in this method, donor nerves also remain intact and without injury. in compare to other classic procedures, end-to-side repair is not much time consuming and needs less dissection. overall, the previous studies in ...

The cut locus C of a closed set A in the Euclidean space E is defined as the closure of the set containing all points p A which have at least two shortest paths to A. We present a theorem stating that the complement of the cut locus i.e. E\(C ∪A) is the maximal open set in (E\A) where the distance function with respect to the set A is continuously A differentiable. This theorem includes also th...

Distinguishing productive zones of a drilled oil well plays a very important role for petroleum engineers to decide where to perforate to produce oil. Conventionally, net pay zones are determined by applying a set of cut-offs on perophysical logs. As a result, the conventional method finds productive intervals crisply. In this investigation, a net index value is proposed, then; diffusivity equa...