214 search results - page 13 / 43 » The node capacitated graph partitioning problem: A computati... |
128
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
105
Voted
JPDC
2007
15 years 21 days ago
2007
Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS de...
140
click to vote
MOBIHOC
2007
ACM
16 years 12 days ago
2007
ACM
We provide a general framework for the analysis of the capacity scaling properties in mobile ad-hoc networks with heterogeneous nodes and spatial inhomogeneities. Existing analyti...
107
click to vote
INFOVIS
2003
IEEE
15 years 6 months ago
2003
IEEE
An increasing number of tasks require people to explore, navigate and search extremely complex data sets visualized as graphs. Examples include electrical and telecommunication ne...
110
click to vote
STACS
2007
Springer
15 years 7 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...