5606 search results - page 80 / 1122 » Randomization Techniques for Graphs. |
SIAMDM
2008
13 years 9 months ago
2008
An n-lift of a digraph K, is a digraph with vertex set V (K)
WAW
2009
Springer
14 years 3 months ago
2009
Springer
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...
CPC
2007
13 years 9 months ago
2007
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
Coping with Information Overload is a major challenge of the 21st century. Huge volumes and varieties of multilingual data must be processed to extract salient information. Previo...
IPL
1998
13 years 9 months ago
1998
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exis...