Interval polynomials are useful to describe perturbed polynomials. We present a graphical tool to describe how perturbations of the polynomial coefficients affect its zeros witho...
The pseudozero set of a system P of polynomials in n variables is the subset of Cn consisting of the union of the zeros of all polynomial systems Q that are near to P in a suitable...
Given a graph G = (V, E) and a positive integer k, the Proper Interval Completion problem asks whether there exists a set F of at most k pairs of (V × V ) \ E such that the graph...
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...
One of the important components of granular computing is interval computations. In interval computations, at each intermediate stage of the computation, we have intervals of possi...
Martine Ceberio, Vladik Kreinovich, Andrzej Pownuk...