: In this paper we deal with the arc ranking problem of directed graphs. We give some classes of graphs for which the arc ranking problem is polynomially solvable. We prove that de...
Let C be a cone in R3 whose base B is a planar convex body in a horizontal plane π and whose tip is a point v /∈ π. Let C be a packing formed by translates of C and −C in R3...
The main aim of this short paper is to answer the following question. Given a fixed graph H, for which values of the degree d does a random d-regular graph on n vertices contain ...
Abstract In this note we discuss the convergence of Newton's method for minimization. We present examples in which the Newton iterates satisfy the Wolfe conditions and the Hes...
Q− is a weaker variant of Robinson arithmetic Q in which addition and multiplication are partial functions, i.e. ternary relations that are graphs of possibly non-total function...