A standard way to approximate the distance between any two vertices p and q on a mesh is to compute, in the associated graph, a shortest path from p to q that goes through one of k sources, which are well-chosen vertices. Precomputing the distance between each of the k sources to all vertices of the graph yields an efficient computation of approximate distances between any two vertices. One sta...

Supramolecular substrate preorganization using DIMPHos ligands, which are bisphosphine ligands equipped with a carboxylate binding site, allows for control over the regioselectivity in hydroformylation reaction. In all reported examples, aldehyde product CO was inserted farthest from directing group, formed excess (for terminal alkenes linear aldehyde). We report here an in-depth DFT study to p...

The purpose of this paper is to discuss some recent generalizations of the basic covering radius problem in coding theory. In particular we discuss multiple coverings, multiple coverings of the farthest-o points and weighted coverings.

We define a symmetric monodical pairing G ◦ H among simply connected co-H spaces G and H with the property that S(G◦H) is equivalent to the smash product G∧H as co-H spaces. We further generalize the Whitehead product map to a map G ◦ H → G ∨ H whose mapping cone is the cartesian product. Whitehead products have played an important role in unstable homotopy. They were originally introduced [Whi...

A central cycle problem requires a cycle that is reasonably short and keeps a the maximum distance from any node not on the cycle to its nearest node on the cycle reasonably low. The objective may be to minimise maximum distance or cycle length and the solution may have further constraints. Most classes of central cycle problems are NP-hard. This paper investigates insertion heuristics for cent...

We present an algorithm that computes the diameter of a set of n points in the cylinder in optimal time O(n log n); this algorithm uses as a fundamental tool the farthest point Voronoi diagram.

William Hamilton argued that even species inhabiting the farthest flung corners of the universe should age. However, a recent study shows that to find a species that escapes ageing, you only need to look as far as your local pond.

The aim of this study was to compare the systemic hemodynamic effects of four commonly used anesthetic regimens in mice chronically instrumented for direct and continuous measurements of cardiac output (CO). Mice (CD-1, Swiss and C57Bl6) were instrumented with a transit-time flow probe placed around the ascending aorta for measurement of CO. An arterial catheter was inserted four to five days l...