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
Cleaning regular graphs with brushes
Noga Alon
, Paweł Prałat
, Nicholas Wormald
Research output
:
Contribution to journal
›
Article
›
peer-review
31
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Cleaning regular graphs with brushes'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Almost Surely
12%
Differential Equation Method
12%
Greedy Algorithm
25%
Lecture Notes
12%
Minimum number
25%
Regular Graph
100%
Mathematics
Asymptotics
25%
Differential Equation
12%
Greedy Algorithm
25%
Regular Graph
100%