Skip to main navigation
Skip to search
Skip to main content
University of Haifa Home
Update your profile
Link opens in a new tab
Search content at University of Haifa
Home
Researchers
Research units
Research output
Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification
Liah Kor
,
Amos Korman
, David Peleg
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Tight Bounds
100%
Minimum Spanning Tree
100%
Verification Algorithm
25%
Time Complexity
12%
Number of Edges
12%
Tight Lower Bound
12%
Distributed Algorithms
12%
Optimal Algorithm
12%
Distributed Verification
12%
Verification Problem
12%
Message Complexity
12%
Spanning Tree Construction
12%
Time-optimal Algorithm
12%
Number of Nodes
12%
Tighter Upper Bound
12%
Computer Science
Spanning Tree
100%
Optimal Algorithm
25%
Tree Construction
12%
Distributed Algorithm
12%