1528 search results - page 148 / 306 » On Signatures for Communication Graphs |
171
click to vote
MOBICOM
2006
ACM
16 years 9 days ago
2006
ACM
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...
152
click to vote
INFOCOM
2005
IEEE
15 years 12 months ago
2005
IEEE
— Medard, Finn, Barry and Gallager proposed an elegant recovery scheme (known as the MFBG scheme) using redundant trees. Xue, Chen and Thulasiraman extended the MFBG scheme and i...
246
click to vote
FCA
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. A main goal of Formal Concept Analysis from its very beginning has been the support of rational communication. The source of this goal lies in our understanding of mathem...
174
click to vote
IWDC
2005
Springer
15 years 12 months ago
2005
Springer
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
185
click to vote
ICC
2007
IEEE
16 years 20 days ago
2007
IEEE
—Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment an...