We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...