3757 search results - page 605 / 752 » The overlap number of a graph |
173
click to vote
INFOVIS
2005
IEEE
16 years 5 hour ago
2005
IEEE
Cartographers have long used flow maps to show the movement of objects from one location to another, such as the number of people in a migration, the amount of goods being traded,...
182
click to vote
ISCC
2005
IEEE
16 years 1 hour 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...
142
click to vote
SAC
2005
ACM
15 years 12 months 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...
195
click to vote
ESA
2005
Springer
15 years 12 months 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...
124
click to vote
ISAAC
2005
Springer
15 years 12 months 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...