Skip to main navigation
Skip to search
Skip to main content
Bar-Ilan University Home
Help & FAQ
Home
Researchers
Organisations
Research output
Prizes
Student theses
Activities
Press/Media
Datasets
Equipment
Search by expertise, name or affiliation
Fault-Tolerant approximate BFS structures
Merav Parter, David Peleg
Weizmann Institute of Science
Research output
:
Contribution to journal
›
Article
›
peer-review
8
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Fault-Tolerant approximate BFS structures'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Resilient
100%
Fault-tolerant
100%
Tight
50%
Polynomial Time
50%
Undirected Graph
50%
N-factor
50%
Multiple Edges
50%
Edge Failure
50%
Constructible
50%
BFS Tree
50%
Network Edge
50%
Fault-tolerant Structure
50%
Additive Stretch
50%
Additive Spanners
50%
Fault Case
50%
Unweighting
50%
Linear Size
50%
Engineering
Polynomial Time
100%
Linear Size
100%
Single Edge
100%
Spanning Tree
100%
Network Edge
100%
Mathematics
Edge
100%
Approximates
100%
Multiplicative
18%
Integer
9%
Spanning Tree
9%
Polynomial Time
9%
Computer Science
Fault Tolerant
100%
Directed Graphs
33%
Spanning Tree
33%
Subgraphs
33%
Polynomial Time
33%