62 search results - page 13 / 13 » A completely dynamic algorithm for split graphs |
JSAC
2007
13 years 5 months ago
2007
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...