Showing papers in "Information Processing Letters in 1975"

TL;DR: The algorithm is a modification of an algorithm by SoWn that works by successively enlarging, components al the MST, by shrinking each group of vertices to node, to obtain a new graph with at most odes.

TL;DR: The nodes in Tare are denoted by small letters (possibly with a subscript) such as u, ur, etc., the edgeq areDenoted by node pairs such as @,q)# an8 the distance (positive numbers) associated with the ‘edp !

TL;DR: The decomposition of a matrix A = A’ f A” where the non-zero eiements of A ‘ (re spectively A “) are exactly the positive (respectively negative) elements of A.

TL;DR: The proof of Schtinhage’s resul t mentioned above is modified, and an algorithm for computing both products uu and uu of quaternions U, u E IE(K) using only ten multiplications is given.

TL;DR: Given a one-dimensional set of N points, it is easy, using a sort operation, to find which of them is the nearest neighbor of each point, and it is still possible to salvage some of the attractive properties found in one dimension, provided that the authors are looking for points sufftciently near the given one.

TL;DR: An integral equation for s specifk potential problem will be solved for different shapes of the unknown boundary function and results will be compared on the basis of their accuracy.