592 search results - page 45 / 119 » Crossing numbers of random graphs |
145
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
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...
170
click to vote
COMGEO
1999
ACM
15 years 5 months ago
1999
ACM
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...
130
click to vote
COMBINATORICS
2007
15 years 5 months ago
2007
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,...
167
click to vote
JSAC
2008
15 years 5 months ago
2008
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 = ...
158
click to vote
FOCS
2009
IEEE
16 years 3 days ago
2009
IEEE
— 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...