We consider the dual of Theorem 1 from [33], relating closure conditions on subcategories with projectivity classes for collections of discrete cocones. We extend these results by...
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Given a graph on n vertices which is the union of two comparability graphs on the same vertex set, it always contains a clique or independent set of size n 1 3 . On the other hand...
We study the limit as n 0 of the nonnegative, self-similar source-type solutions of the thin film equation ut + (unuxxx)x = 0. We obtain a unique limiting function u, which is a s...
Abstract. Solutions of the optimal control and H-control problems for nonlinear affine systems can be found by solving Hamilton-Jacobi equations. However, these first order nonline...