1930 search results - page 1 / 386 » A Dynamic Graph Algorithm for the Highly Dynamic Network Pro... |
PERCOM
2006
ACM
14 years 4 months ago
2006
ACM
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
DIALM
2005
ACM
13 years 6 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
BMCBI
2005
13 years 4 months ago
2005
Background: To study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computatio...
HPCC
2005
Springer
13 years 10 months ago
2005
Springer
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...