Exact communication costs for consensus and leader in a tree

Author： Dinitz Y.   Moran S.   Rajsbaum S.  

Publisher： Elsevier

ISSN： 1570-8667

Source： Journal of Discrete Algorithms, Vol.1, Iss.2, 2003-04, pp. : 167-183

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

LQR‐based optimal topology of leader‐following consensus

By  

INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL, Vol. 25, Iss. 17, 2015-11 ,pp. : 3404-3421

John Wiley & Sons Inc

Access to resources Recommend Favorite

Constructing the Maximum Consensus Tree from Rooted Triples

By Wu Bang Ye  

Journal of Combinatorial Optimization, Vol. 8, Iss. 1, 2004-03 ,pp. : 29-39

Springer Publishing Company

Access to resources Recommend Favorite

Exact and Heuristic Algorithms for Dynamic Tree Simplification

By Correa Carlos   Marsic Ivan   Sun Xiaodong  

Journal of Mathematical Modelling and Algorithms, Vol. 4, Iss. 4, 2005-12 ,pp. : 331-353

Springer Publishing Company

Access to resources Recommend Favorite

Distributed dynamic consensus under quantized communication data

By  

INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL, Vol. 25, Iss. 11, 2015-07 ,pp. : 1704-1720

John Wiley & Sons Inc

Access to resources Recommend Favorite

Generation of the Exact Distribution and Simulation of Matched Nucleotide Sequences on a Phylogenetic Tree

By Ababneh Faisal   Jermiin Lars   Robinson John  

Journal of Mathematical Modelling and Algorithms, Vol. 5, Iss. 3, 2006-09 ,pp. : 291-308

Springer Publishing Company

Access to resources Recommend Favorite