5100 search results - page 731 / 1020 » The Linear Complexity of a Graph |
141
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An S...
159
click to vote
INFOCOM
2007
IEEE
16 years 27 days ago
2007
IEEE
— We consider the problem of serving multicast flows in a crossbar switch. We show that linear network coding across packets of a flow can sustain traffic patterns that cannot...
153
click to vote
PODC
2006
ACM
16 years 16 days ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
180
click to vote
SPAA
2006
ACM
16 years 16 days ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
164
click to vote
CONCUR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...