225 search results - page 23 / 45 » Stably Computable Properties of Network Graphs |
147
click to vote
TROB
2008
15 years 3 months ago
2008
Control of mobile networks raises fundamental and novel problems in controlling the structure of the resulting dynamic graphs. In particular, in applications involving mobile senso...
114
Voted
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
This paper presents our work on the static task scheduling model using the mean-field annealing (MFA) technique. Mean-field annealing is a technique of thermostatic annealing that...
134
Voted
ICPP
1991
IEEE
15 years 7 months ago
1991
IEEE
There is an interesting class of ICNs, which includes the star graph and the n-way shuffle, for which the network diameter is sub-logarithmic in the network size. This paper prese...
133
Voted
PODC
2005
ACM
15 years 9 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
146
Voted
WG
2009
Springer
15 years 10 months ago
2009
Springer
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...