We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
Glencora Borradaile, Erik D. Demaine, Siamak Tazar...
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
Most current graph layout technology does not lend itself to interactive applications such as animation or advanced user interfaces. We introduce the constrained graph layout model...
This paper studies connectivity maintenance in robotic networks. We propose a distributed coordination algorithm that can be combined with the individual motion control strategies ...
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...