منابع مشابه
reciprocal degree distance of some graph operations
the reciprocal degree distance (rdd), defined for a connected graph $g$ as vertex-degree-weighted sum of the reciprocal distances, that is, $rdd(g) =sumlimits_{u,vin v(g)}frac{d_g(u) + d_g(v)}{d_g(u,v)}.$ the reciprocal degree distance is a weight version of the harary index, just as the degree distance is a weight version of the wiener index. in this paper, we present exact formu...
متن کاملEdit Distance with Move Operations
The traditional edit-distance problem is to find the minimum number of insert-character and delete-character (and sometimes change character) operations required to transform one string into another. Here we consider the more general problem of a string represented by a singly linked list (one character per node) and being able to apply these operations to the pointer associated with a vertex a...
متن کاملDistance Based Graph Invariants of Graph Operations
Abstract In this paper, the exact formulae for the Harary indices of join, disjunction, symmetric difference, strong product of graphs are obtained. Also, the Schultz and modified Schultz indices of join and strong product of graphs are computed. We apply some of our results to compute the Harary, Schultz and modified Schultz indices of fan graph, wheel graph, open fence and closed fence graphs.
متن کاملPredictive Interfaces for Long-distance Tele-operations
Humanoid robots have a practical advantage over other robotic platforms for use in space-based construction and maintenance because they can share tools and work interactively with astronauts. A major disadvantage is that they are difficult to control due to the large number of degrees of freedom, which makes it difficult to synthesize autonomous behavior using conventional means. We address th...
متن کاملgProximity: Hierarchical GPU-based Operations for Collision and Distance Queries
We present novel parallel algorithms for collision detection and separation distance computation for rigid and deformable models that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data parallelism to perform fast hierarchy construction, updating, and traversal using tight-fitting bounding volumes such as oriented bounding boxes (OBB) and rectangular swep...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geographic Information Science & Technology Body of Knowledge
سال: 2019
ISSN: 2577-2848
DOI: 10.22224/gistbok/2019.3.3