A comparative study of spanning tree and gossip protocols for aggregation

Publisher： John Wiley & Sons Inc

E-ISSN： 1532-0634|27|16|4091-4106

ISSN： 1532-0626

Source： CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol.27, Iss.16, 2015-11, pp. : 4091-4106

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the Euclidean Minimum Spanning Tree Problem

By Rajasekaran Sanguthevar  

Computing Letters, Vol. 1, Iss. 1, 2005-01 ,pp. : 11-14

VSP

Access to resources Recommend Favorite

The Stackelberg Minimum Spanning Tree Game

By Cardinal Jean   Demaine Erik   Fiorini Samuel   Joret Gwenaël   Langerman Stefan   Newman Ilan   Weimann Oren  

Algorithmica, Vol. 59, Iss. 2, 2011-02 ,pp. : 129-144

Springer Publishing Company

Access to resources Recommend Favorite

A comparative study of exchange and aggregation models in the B2B e-marketplace

By Chang Hsin-Lu   Easley Robert   Shaw Michael  

Information Systems and e-Business Management, Vol. 1, Iss. 2, 2003-01 ,pp. : 213-228

Springer Publishing Company

Access to resources Recommend Favorite

The Complexity of Minimum Ratio Spanning Tree Problems

By Skiścim Christopher   Palocsay Susan  

Journal of Global Optimization, Vol. 30, Iss. 4, 2004-12 ,pp. : 335-346

Springer Publishing Company

Access to resources Recommend Favorite

On the prize-collecting generalized minimum spanning tree problem

By Pop P.  

Annals of Operations Research, Vol. 150, Iss. 1, 2007-03 ,pp. : 193-204

Springer Publishing Company

Access to resources Recommend Favorite