617 search results - page 97 / 124 » On the Chromatic Number of Random Graphs |
150
click to vote
MOBICOM
2004
ACM
15 years 9 months ago
2004
ACM
Interactive communications among nodes in Vehicular Ad Hoc Networks (VANET) and the safety-oriented nature of many VANET applications necessitate a robust security framework. An a...
122
click to vote
WADS
1993
Springer
15 years 8 months ago
1993
Springer
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...
137
click to vote
WAW
2009
Springer
15 years 11 months ago
2009
Springer
We present a deterministic model for on-line social networks based on transitivity and local knowledge in social interactions. In the Iterated Local Transitivity (ILT) model, at ea...
141
click to vote
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
138
click to vote
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...