Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Search by expertise, name or affiliation
Testing subgraphs in directed graphs
Noga Alon
, Asaf Shapira
Research output
:
Contribution to journal
›
Article
›
peer-review
77
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Testing subgraphs in directed graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Query Complexity
81%
Directed Graph
80%
Subgraph
70%
Testing
60%
Regularity Lemma
34%
Polynomial Complexity
33%
Undirected Graph
23%
Digraph
22%
Characterization
19%
Additive number Theory
18%
Imply
15%
Polynomial
12%
Query
12%
Bipartite Graph
11%
Open Problems
9%
NP-complete problem
9%
Upper bound
7%
Graph in graph theory
5%
Engineering & Materials Science
Directed graphs
100%
Polynomials
52%
Testing
44%
Number theory
25%