139 search results - page 13 / 28 » The Domatic Number of Regular Graphs |
LCN
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
CIKM
2011
Springer
12 years 7 months ago
2011
Springer
Extracting information from web pages is an important problem; it has several applications such as providing improved search results and construction of databases to serve user qu...
DAM
2008
13 years 7 months ago
2008
We study the combinatorial problem of finding an arrangement of distinct integers into the ddimensional N-cube so that the maximal variance of the numbers on each -dimensional sec...
CPC
1998
13 years 7 months ago
1998
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, ...
ISPAN
2005
IEEE
14 years 1 months ago
2005
IEEE
For a given graph G = (V, E) and a positive integer k, the super line graph of index k of G is the graph Sk(G) which has for vertices all the k-subsets of E(G), and two vertices S...