390 search results - page 62 / 78 » Computing shortest paths for any number of hops |
WEA
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
CCR
2004
14 years 11 months ago
2004
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
103
click to vote
WG
1994
Springer
15 years 3 months ago
1994
Springer
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...
105
click to vote
MOBICOM
2006
ACM
15 years 5 months ago
2006
ACM
In this paper, we consider the problem of mitigating interference and improving network capacity in wireless mesh networks from the angle of temporal-spatial diversity. In a nutsh...
106
click to vote
AINA
2008
IEEE
15 years 6 months ago
2008
IEEE
—In a broadcasting task, source node wants to send the same message to all the other nodes in the network. Existing solutions range from connected dominating set (CDS) based for ...