maximum node degree | Sciweavers

39

OPODIS
2010

130views Distributed And Parallel Com...» more OPODIS 2010»

Self-stabilizing Byzantine Asynchronous Unison,

13 years 9 months ago

We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under less than s...

Swan Dubois, Maria Gradinariu Potop-Butucaru, Mikh...

claim paper

Read More »

33

click to vote

ALGORITHMICA
2004

153views more ALGORITHMICA 2004»

Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem

13 years 11 months ago

Download pluto.huji.ac.il

We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...

Jochen Könemann, Asaf Levin, Amitabh Sinha

claim paper

Read More »

27

click to vote

TC
2008

89views Information Technology» more TC 2008»

Localized Broadcasting with Guaranteed Delivery and Bounded Transmission Redundancy

13 years 11 months ago

Download www.ece.ubc.ca

The common belief is that localized broadcast algorithms are not able to guarantee both full delivery and a good bound on the number of transmissions. In this paper, we propose the...

Majid Khabbazian, Vijay K. Bhargava

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers