1949 search results - page 66 / 390 » Random graphs on surfaces |
146
click to vote
CPC
2007
15 years 3 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...
132
click to vote
AIRS
2006
Springer
15 years 7 months ago
2006
Springer
Document clustering techniques mostly depend on models that impose explicit and/or implicit priori assumptions as to the number, size, disjunction characteristics of clusters, and/...
133
click to vote
ICASSP
2010
IEEE
15 years 2 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...
118
click to vote
IPL
1998
15 years 3 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...
110
click to vote
CCA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Elton’s theorem, it is shown that almost all sequences obtaine...