721 search results - page 28 / 145 » Almost universal graphs |
138
click to vote
ICC
2007
IEEE
16 years 26 days ago
2007
IEEE
— We propose a unifying framework for max-min fairness in orthogonal networks and networks with interference. First, a universal formulation of the max-min fairness problem for o...
153
click to vote
CCA
2009
Springer
16 years 1 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...
139
click to vote
COMBINATORICA
2006
15 years 6 months ago
2006
Given a universal binary countable homogeneous structure U and n , there is a partition of the induced n-element substructures of U into finitely many classes so that for any par...
192
click to vote
GC
2011
Springer
14 years 10 months ago
2011
Springer
ties: Graded for Calculus III and substituted in Abstract Algebra • Adjunct Instructor, Tri-County Technical College (2005) (864) 646-1368 Courses Taught: Intermediate Algebra, C...
170
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
This paper explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in...