422 search results - page 56 / 85 » Shortest paths between shortest paths and independent sets |
IPPS
1997
IEEE
14 years 25 days ago
1997
IEEE
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...
ESA
2010
Springer
13 years 9 months ago
2010
Springer
This paper studies the geodesic diameter of polygonal domains having h holes and n corners. For simple polygons (i.e., h = 0), it is known that the geodesic diameter is determined...
WWW
2005
ACM
14 years 9 months ago
2005
ACM
Focused crawlers are considered as a promising way to tackle the scalability problem of topic-oriented or personalized search engines. To design a focused crawler, the choice of s...
WEA
2010
Springer
14 years 3 months ago
2010
Springer
We successfully contract timetable networks with realistic transfer times. Contraction gradually removes nodes from the graph and adds shortcuts to preserve shortest paths. This r...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
— Without the multicast support from the underlying networks, overlay multicast has the advantage of implementing inter-domain multicast communications. Usually, overlay multicas...