1951 search results - page 196 / 391 » An algorithm for improving graph partitions |
161
click to vote
APVIS
2006
15 years 7 months ago
2006
A common problem in visualising some networks is the presence of localised high density areas in an otherwise sparse graph. Applying common graph drawing algorithms on such networ...
202
click to vote
PR
2008
15 years 6 months ago
2008
Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with ...
158
click to vote
JETAI
2008
15 years 6 months ago
2008
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
163
click to vote
WWW
2004
ACM
16 years 6 months ago
2004
ACM
In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network....
154
click to vote
ICPP
1992
IEEE
15 years 10 months ago
1992
IEEE
-- Distributed routing algorithms presented in the literature have tended to be specific to a particular network topology. In order to test the applicability of various routing str...