24741 search results - page 648 / 4949 » Virtual Network Computing |
269
click to vote
OL
2011
15 years 2 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
194
click to vote
ICN
2007
Springer
16 years 1 months ago
2007
Springer
There has been an increasing number of network deployments that provide dedicated connections through on-demand and in-advance scheduling in support of highperformance application...
197
click to vote
PODC
2009
ACM
15 years 12 months ago
2009
ACM
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
213
click to vote
COCOON
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...
201
Voted
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
—For label switched networks, such as MPLS and GMPLS, most existing traffic engineering (TE) solutions work in a single routing domain. These solutions do not work when a route ...