Given a set S of n points in the plane, a minimumdilation spanning tree of S is a tree with vertex set S of smallest possible dilation. We show that given a set S of n points and ...
A directed star forest is a forest all of whose components are stars with arcs emanating from the center to the leaves. The acircuitic directed star arboricity of an oriented grap...
: Both the pancake graph and star graph are Cayley graphs and are especially attractive for parallel processing. They both have sublogarithmic diameter, and are fairly sparse compa...
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...