334 search results - page 21 / 67 » Practical Parallel Algorithms for Minimum Spanning Trees |
ICMCS
2010
IEEE
14 years 10 months ago
2010
IEEE
Though the existence of a minimum delay peer-to-peer media streaming scheme has been shown (under the name of snowball streaming), no actual algorithm has ever been designed so fa...
OPODIS
2004
14 years 11 months ago
2004
Abstract. Ad-hoc networks do not provide an infrastructure for communication such as routers and are characterized by 1) quick changes of communication topology and 2) unstable sys...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
WAOA
2007
Springer
15 years 3 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
INFOCOM
1992
IEEE
15 years 1 months ago
1992
IEEE
This paper describes a methodology for designing interconnected LAN-MAN networks with the objective of minimizing the average network delay. We consider IEEE 802.3-5 LANs intercon...