Skip to main navigation
Skip to search
Skip to main content
Tel Aviv University Home
Update Request & User Guide (TAU staff only)
Home
Experts
Research units
Research output
Datasets
Prizes
Activities
Press/Media
Search by expertise, name or affiliation
Property testing in bounded degree graphs
O. Goldreich
*
,
D. Ron
*
Corresponding author for this work
Engineering General
Weizmann Institute of Science
Research output
:
Contribution to journal
›
Article
›
peer-review
258
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Property testing in bounded degree graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Bounded Degree Graphs
100%
Property Testing
100%
High Probability
66%
Expander
33%
Query Complexity
33%
K-connected
33%
Oracle
33%
Number of Edges
33%
Vertex Pair
33%
Testing Algorithm
33%
Dense Graphs
33%
Randomized Algorithms
33%
Cycle-free
33%
Graph Properties
33%
Adjacency Matrix
33%
Degree Graph
33%
2-connectivity
33%
2-edge-connected
33%
Bounded Length
33%
Eulerian
33%
Mathematics
Edge
100%
Property Testing
100%
Probability Theory
66%
Expander
33%
Polynomial Time
33%
Query Complexity
33%
Adjacency Matrix
33%
Computer Science
Polynomial Time
100%
Randomized Algorithm
100%
Adjacency Matrix
100%