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
Space-Efficient counting in graphs on surfaces
Mark Braverman
, Raghav Kulkarni
, Sambuddha Roy
Research output
:
Contribution to journal
›
Article
›
peer-review
4
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Space-Efficient counting in graphs on surfaces'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Valiant
100%
Graphs on Surfaces
100%
Log-space
100%
Higher Genus
100%
Perfect Matching
100%
Efficient Counting
100%
Counting Spanning Trees
50%
Counting Problems
50%
Graph Recognition
50%
Matchings in Bipartite Graphs
50%
Highly Parallel
50%
Mathematics
Perfect Matchings
66%
Bipartite Graph
33%
Counting Problem
33%