2487 search results - page 166 / 498 » Partitions of Graphs into Trees |
175
click to vote
PODC
2009
ACM
16 years 4 months ago
2009
ACM
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
117
Voted
ICPP
2007
IEEE
15 years 10 months ago
2007
IEEE
Program parallelization requires mapping computation and data to processing elements. Navigational Programming (NavP), based on the principle of migrating computations, offers a d...
126
click to vote
TVCG
2010
14 years 10 months ago
2010
Abstract--One important bottleneck when visualizing large data sets is the data transfer between processor and memory. Cacheaware (CA) and cache-oblivious (CO) algorithms take into...
119
Voted
INFOCOM
2005
IEEE
15 years 9 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...
121
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...