214 search results - page 22 / 43 » The node capacitated graph partitioning problem: A computati... |
144
Voted
FOCS
2004
IEEE
15 years 4 months ago
2004
IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
124
Voted
TON
2010
14 years 11 months ago
2010
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
119
Voted
IPPS
2003
IEEE
15 years 6 months ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
107
click to vote
ADHOCNOW
2004
Springer
15 years 6 months ago
2004
Springer
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
86
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...