Sciweavers

1545 search results - page 144 / 309
» On tree congestion of graphs
Sort
View
CORR
2010
Springer
102views Education» more  CORR 2010»
14 years 10 months ago
Detecting Weak but Hierarchically-Structured Patterns in Networks
The ability to detect weak distributed activation patterns in networks is critical to several applications, such as identifying the onset of anomalous activity or incipient conges...
Aarti Singh, Robert D. Nowak, A. Robert Calderbank
APPROX
2004
Springer
136views Algorithms» more  APPROX 2004»
15 years 3 months ago
On the Crossing Spanning Tree Problem
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit...
GECCO
2006
Springer
148views Optimization» more  GECCO 2006»
15 years 1 months ago
An effective genetic algorithm for the minimum-label spanning tree problem
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
Jeremiah Nummela, Bryant A. Julstrom
104
Voted
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
15 years 1 months ago
Estimating the destructiveness of crossover on binary tree representations
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
Luke Sheneman, James A. Foster
AAAI
2007
15 years 13 days ago
Dynamic DFS Tree in ADOPT-ing
Several distributed constraint reasoning algorithms employ Depth First Search (DFS) trees on the constraint graph that spans involved agents. In this article we show that it is po...
Marius-Calin Silaghi, Makoto Yokoo