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
Lower bounds for testing Euclidean Minimum Spanning Trees
Oren Ben-Zwi
, Oded Lachish
,
Ilan Newman
Department of Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Lower bounds for testing Euclidean Minimum Spanning Trees'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Adaptive Properties
50%
Asymptotically Optimal
25%
Bounded Degree
25%
Error Properties
25%
Euclidean Distance
25%
Euclidean Minimum Spanning Tree
100%
Minimum Spanning Tree
25%
Minimum Spanning Tree Problem
25%
Non-adaptive
50%
Optimal Complexity
25%
Query Complexity
75%
Sqrt
50%
Two-dimensional Plane
25%
Mathematics
Dimensional Plane
20%
Euclidean Distance
20%
Minimum Spanning Tree
100%
Query Complexity
60%