6598 search results - page 992 / 1320 » Graph Theory with Applications |
221
click to vote
FSTTCS
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
213
click to vote
WAW
2004
Springer
16 years 3 days ago
2004
Springer
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
179
Voted
CC
2009
Springer
15 years 11 months ago
2009
Springer
Single-assignment languages with copy semantics have a very simple and approachable programming model. A na¨ıve implementation of the copy semantics that copies the result of eve...
194
click to vote
ISPD
2000
ACM
15 years 11 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
191
click to vote
SIGADA
1999
Springer
15 years 11 months ago
1999
Springer
In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...