Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
Efficient testing of large graphs
Noga Alon
, Eldar Fischer
, Michael Krivelevich
, Mario Szegedy
Research output
:
Contribution to journal
›
Article
›
peer-review
266
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Efficient testing of large graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Large Graphs
100%
Graph Properties
100%
Efficient Testing
100%
High Probability
33%
First-order
33%
Randomized Algorithms
33%
General Type
33%
Ordered Graphs
33%
P-property
33%
Coloring Problem
33%
Colorability
33%
Logical Characterization
33%
Quantifier Alternation
33%
Mathematics
Probability Theory
100%
Edge
100%
Total Number
100%
Colorability
100%
Computer Science
Randomized Algorithm
100%
Coloring Problem
100%