367 search results - page 60 / 74 » Set connectivity problems in undirected graphs and the direc... |
TON
2010
13 years 5 months ago
2010
— Despite significant efforts to obtain an accurate picture of the Internet’s connectivity structure at the level of individual autonomous systems (ASes), much has remained un...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
MMNS
2007
13 years 8 months ago
2007
An important question in multi-radio multi-channel and multi-hop networks is how to perform efficient network-wide broadcast. Currently almost all broadcasting protocols assume a s...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
MP
1998
13 years 7 months ago
1998
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...