A straight-line drawing of a graph is a monotone drawing if for each pair of vertices there is a path which is monotonically increasing in some direction, and it is called a strongly monotone drawing if the direction of monotonicity is given by the direction of the line segment connecting the two vertices. We present algorithms to compute crossing-free strongly monotone drawings for some classe...

We consider the general class of strongly Fejer monotone map-pings and some of their basic properties. These properties are useful for a convergence theory of corresponding iterative methods which are widely used to solve convex problems (see e.g. 3], 6], 7], 10]). In part I we study the relation between these mappings and their relaxations. 1 Strongly Fejer monotone mappings Let H be a (real) ...

Abstract In a real Hilbert space, let GSVI and CFPP represent general system of variational inequalities common fixed point problem countable family nonexpansive mappings an asymptotically mapping, respectively. this paper, via new subgradient extragradient implicit rule, we introduce analyze two iterative algorithms for solving the monotone bilevel equilibrium (MBEP) with constraints, i.e., st...