100 search results - page 5 / 20 » Unicyclic Components in Random Graphs |
LATIN
2004
Springer
14 years 29 days ago
2004
Springer
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
RSA
2010
13 years 6 months ago
2010
The 2-dimensional Hamming graph H(2, n) consists of the n2 vertices (i, j), 1 ≤ i, j ≤ n, two vertices being adjacent when they share a common coordinate. We examine random sub...
ICALP
2003
Springer
14 years 24 days ago
2003
Springer
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
RSA
2011
13 years 2 months ago
2011
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
ECML
2004
Springer
14 years 1 months ago
2004
Springer
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...