1067 search results - page 20 / 214 » Probabilistic regular graphs |
117
click to vote
MFCS
2009
Springer
15 years 7 months ago
2009
Springer
An edge cover C of an undirected graph is a set of edges such that every vertex has an adjacent edge in C. We show that a Glauber dynamics Markov chain for edge covers mixes rapidl...
107
click to vote
GC
2010
Springer
15 years 1 months ago
2010
Springer
Intriguing and tight sets of vertices of point-line geometries have recently been studied in the literature. In this paper, we indicate a more general framework for dealing with t...
127
click to vote
EJC
2011
14 years 9 months ago
2011
Henning and Yeo proved a lower bound for the minimum size of a maximum matching in a connected k-regular graphs with n vertices; it is sharp infinitely often. In an earlier paper...
102
click to vote
ICDCIT
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, we consider a contaminated network with an intruder. The task for the mobile agents is to decontaminate all hosts while preventing a recontamination and to do so as ...
104
click to vote
ICIP
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper develops a classification algorithm in the framework of spectral graph theory where the underlying manifold of a high dimensional data set is described by a graph. The...