4171 search results - page 659 / 835 » Choice numbers of graphs |
186
click to vote
ISCC
2005
IEEE
16 years 3 days ago
2005
IEEE
We propose routing schemes that optimize the average number of hops for lookup requests in Peer–to–Peer (P2P) systems without adding any overhead to the system. Our work is in...
147
click to vote
SAC
2005
ACM
16 years 2 days ago
2005
ACM
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
197
click to vote
ESA
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
164
click to vote
GD
2005
Springer
16 years 1 days ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
126
click to vote
ISAAC
2005
Springer
16 years 17 hour ago
2005
Springer
We consider generalizations of the k-source sum of vertex eccentricity problem (k-SVET) and the k-source sum of source eccentricity problem (k-SSET) [1], which we call SDET and SSE...