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
Optimal universal graphs with deterministic embedding
Noga Alon
, Michael Capalbo
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
31
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Optimal universal graphs with deterministic embedding'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Graph Families
100%
Universal Graphs
100%
K-edge
50%
Maximum Degree
50%
Deterministic Algorithm
50%
Number of Edges
50%
Finite Family
50%
Mathematics
Edge
100%
Maximum Degree
50%
Constant Factor
50%
Finite Family
50%