3958 search results - page 325 / 792 » Dynamic Graph Algorithms with Applications |
174
click to vote
IDA
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
225
click to vote
CIKM
2008
Springer
15 years 9 months ago
2008
Springer
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...
198
click to vote
GD
2005
Springer
16 years 24 days ago
2005
Springer
We give a drawing of Kn in three dimensions in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounde...
207
click to vote
EVOW
2004
Springer
16 years 20 days ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
212
click to vote
SIGARCH
2008
15 years 7 months ago
2008
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...