970 search results - page 54 / 194 » On encodings of spanning trees |
SIGCOMM
2000
ACM
14 years 1 months ago
2000
ACM
As the number of hosts attached to a network increases beyond what can be connected by a single local area network (LAN), forwarding packets between hosts on different LANs become...
JPDC
2006
13 years 8 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
WINET
2010
13 years 7 months ago
2010
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
COLOGNETWENTE
2009
13 years 10 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
ICC
2007
IEEE
14 years 20 days ago
2007
IEEE
An algorithm for efficient encoding of LDPC codes is presented that does not impose any restrictions on the construction of the parity-check matrices. The algorithm modifies the pa...