CJCDGCGT
2005
Springer
13 years 10 months ago
2005
Springer
CJCDGCGT
2005
Springer
13 years 10 months ago
2005
Springer
CJCDGCGT
2005
Springer
13 years 10 months ago
2005
Springer
CJCDGCGT
2005
Springer
13 years 10 months ago
2005
Springer
CJCDGCGT
2005
Springer
13 years 10 months ago
2005
Springer
![A Neighborhood Condition for Graphs to Have [ a , b ]-Factors III](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/a_neighborhood_condition_for_graphs_to_have_a_b_factors_iii_CJCDGCGT_2005.jpg "A Neighborhood Condition for Graphs to Have [ a , b ]-Factors III")
CJCDGCGT
2005
Springer
13 years 10 months ago
2005
Springer
CAAN
2007
Springer
13 years 10 months ago
2007
Springer
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...
CAAN
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...
CAAN
2007
Springer
13 years 10 months ago
2007
Springer
Topological routing is basically table free, and allows for very fast restoration and thus a high level of reliability in communication. It has already been satisfactorily proposed...
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...