We show how to associate an R-tree to the set of cut points of a continuum. If X is a continuum without cut points we show how to associate an R-tree to the set of cut pairs of X . AMS Classification 54F15,54F05,20F65,20E08

Let A be a set of n arcs on the unit circle. We present a new simple (n logn)-time algorithm for computing a minimum cut set for A (and a maximum independent subset of A). Our solution is based on a dynamic maintenance scheme for a set S of n intervals on the line, that enables us to update the current minimum cut set for S, following an insertion or a deletion of an interval, in time O(c logn)...

In this note, the cut C is referred as the cut-set and the size of the cut |C| as the size of the cut-set. For a graph, a maximum cut is a cut whose size is at least the size of any other cut. The problem of finding a maximum cut in a graph is known as the maximum cut problem. The problem is NP-hard. Simple 0.5approximation algorithms existed long time ago, but no improvement was made till 1990...

We define a generalization CERES of the first-order cut-elimination method CERES to higher-order logic. At the core of CERES lies the computation of an (unsatisfiable) set of sequents CS(π) (the characteristic sequent set) from a proof π of a sequent S. A refutation of CS(π) in a higher-order resolution calculus can be used to transform cut-free parts of π (the proof projections) into a cut-fre...

Until now single values of IRR are traditionally used to estimate the time value of cash flows. Since uncertainty exists in estimating cost data, the resulting decision may not be reliable. The most commonly cited drawbacks to using the internal rate of return in evaluatton of deterministic cash flow streams is the possibility of multiple conflicting internal rates of return. In this paper we p...

We consider a new combinatorial optimization problem that combines network design and facility location aspects. Given a graph with two types of customers and two technologies that can be installed on the edges, the objective is to find a minimum cost subtree connecting all customers while the primary customers are served by a primary subtree that is embedded into the secondary subtree. In addi...

OBJECTIVE Seed filling in view lattice is a method for accelerating volume rendering. Our previously published results on using seed filling had the limitation that they did not support cut planes. Cut planes are one of the main advantages of using volume rendering over surface rendering. In this article we describe the seed-filling acceleration technique and propose two fast reseeding processe...

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

An instance of the (finite-)Valued Constraint Satisfaction Problem (VCSP) is given by a finite set of variables, a finite domain of values, and a sum of (rational-valued) functions, each function depending on a subset of the variables. The goal is to find an assignment of values to the variables that minimises the sum. We study (assuming that PTIME , NP) how the complexity of this very general ...