Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Activities
Research Labs / Equipment
Datasets
Projects
Search by expertise, name or affiliation
Efficient algorithms for constructing very sparse spanners and emulators
Michael Elkin
,
Ofer Neiman
Department of Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
44
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Efficient algorithms for constructing very sparse spanners and emulators'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Spanners
100%
Sparse Spanners
100%
Emulator
100%
Log-log
33%
Distributed Algorithms
33%
Unweighting
33%
Linear Time
16%
Number of Edges
16%
Connected Spanning Subgraph
16%
CONGEST Model
16%
Unweighted Graph
16%
K Parameter
16%
Superlinear
16%
K-edge
16%
Centralized Model
16%
CONGEST
16%
Approximate Shortest Paths
16%
Near-Linear Time Algorithm
16%
Shortest Path Computation
16%
PRAM Model
16%
Computer Science
Efficient Algorithm
100%
Distributed Algorithm
100%
Subgraphs
50%
Centralized Model
50%
Shortest Path Computation
50%