279 search results - page 30 / 56 » Approximating Average Parameters of Graphs |
132
Voted
TAMC
2010
Springer
15 years 7 months ago
2010
Springer
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
140
Voted
STOC
2005
ACM
16 years 2 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
131
Voted
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
204
Voted
CP
2009
Springer
16 years 3 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
111
Voted
CCR
2010
15 years 2 months ago
2010
TCP flows start with an initial congestion window of at most four segments or approximately 4KB of data. Because most Web transactions are short-lived, the initial congestion wind...