70 search results - page 4 / 14 » Degree sequence and supereulerian graphs |
RSA
2010
13 years 5 months ago
2010
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
COMPGEOM
2010
ACM
14 years 15 days 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...
DM
2008
13 years 7 months ago
2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...
SODA
2008
ACM
13 years 8 months ago
2008
ACM
In the past decades the Gn,p model of random graphs, introduced by Erdos and R