Skip to main navigation
Skip to search
Skip to main content
Weizmann Institute of Science Home
Home
Profiles
Research units
Research output
Datasets
Search by expertise, name or affiliation
Deterministic Replacement Path Covering
C. S. Karthik
*
,
Merav Parter
*
Corresponding author for this work
Department of Computer Science and Applied Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Deterministic Replacement Path Covering'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Replacement Paths
100%
Covering Value
100%
Path Cover
100%
Hash Family
75%
Derandomization
50%
Deterministic Algorithm
50%
Fault-tolerant
50%
Fault-tolerant Spanner
50%
Deterministic Construction
50%
Distance Sensitivity Oracle
50%
Unified Approach
25%
Time Complexity
25%
Shortest Path
25%
Spanners
25%
Graph Algorithms
25%
Error Correction Codes
25%
Simplified Approach
25%
Size Bounds
25%
Query Response Time
25%
Algebraic Error
25%
Vertex Pair
25%
Randomized Setting
25%
Randomized Constructions
25%
Breadth-first Search
25%
Key Barriers
25%
Algebraic Geometry Codes
25%
Reed-Solomon Codes
25%
Integer Parameters
25%
Number of Subgraphs
25%
Algebraic Construction
25%
Mathematics
Edge
100%
Derandomization
50%
Open Problem
25%
Integer
25%
Wide Range
25%
Error Correcting Codes
25%
Graph Algorithm
25%
Solomon Code
25%
Algebraic Construction
25%
Computer Science
Fault Tolerant
100%
Subgraphs
75%
Time Complexity
25%
Error Correcting Codes
25%
Graph Algorithms
25%