Sciweavers

241 search results - page 46 / 49
» Degree Bounded Spanning Trees
Sort
View
ESA
2009
Springer
107views Algorithms» more  ESA 2009»
14 years 1 months ago
Disproof of the Neighborhood Conjecture with Implications to SAT
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
Heidi Gebauer
ISCI
2007
108views more  ISCI 2007»
13 years 7 months ago
A degree-constrained QoS-aware routing algorithm for application layer multicast
Application layer multicast (ALM) provides a low-cost solution for multicast over the Internet. It overcomes the deployment hurdle of IP multicast by moving all multicast related ...
Baoliu Ye, Minyi Guo, Daoxu Chen, Sanglu Lu
JCSS
2008
90views more  JCSS 2008»
13 years 7 months ago
Fault tolerance in cellular automata at high fault rates
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply ...
Mark McCann, Nicholas Pippenger
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
14 years 25 days ago
On the Minimum Load Coloring Problem
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...
SPAA
2005
ACM
14 years 27 days ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...