Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the t...
Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Ma...
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...