Sciweavers

1545 search results - page 121 / 309
» On tree congestion of graphs
Sort
View
AHSWN
2010
105views more  AHSWN 2010»
14 years 10 months ago
Optimal Gathering Algorithms in Multi-Hop Radio Tree-Networks with Interferences
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network,...
Jean-Claude Bermond, Min-Li Yu
CORR
2006
Springer
166views Education» more  CORR 2006»
14 years 10 months ago
Bounding the Bias of Tree-Like Sampling in IP Topologies
Abstract. It is widely believed that the Internet's AS-graph degree distribution obeys a power-law form. However, it was recently argued that since Internet data is collected ...
Reuven Cohen, Mira Gonen, Avishai Wool
CDC
2010
IEEE
106views Control Systems» more  CDC 2010»
14 years 5 months ago
Semi-autonomous networks: Network resilience and adaptive trees
This paper examines the dynamics of a networked multi-agent system operating with a consensus-type coordination algorithm that can be influenced by external agents. We refer to thi...
Airlie Chapman, Mehran Mesbahi
CORR
2010
Springer
164views Education» more  CORR 2010»
14 years 10 months ago
Schnyder decompositions for regular plane graphs and application to drawing
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...
Olivier Bernardi, Éric Fusy
CORR
2010
Springer
69views Education» more  CORR 2010»
14 years 5 months ago
Embedding a Forest in a Graph
For p 1, we prove that every forest with p trees whose sizes are a1, . . . , ap can be embedded in any graph containing at least p i=1(ai + 1) vertices and having minimum degree ...
Mark K. Goldberg, Malik Magdon-Ismail