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
Color-coding: A new method for finding simple paths, cycles and other small subgraphs within large graphs
Noga Alon
, Raphy Yuster
, Uri Zwick
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
55
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Color-coding: A new method for finding simple paths, cycles and other small subgraphs within large graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Bounded Treewidth Graphs
33%
Color Coding
100%
Encoding Method
33%
Expected Time
66%
Exponent of Matrix multiplication
33%
Graph Families
33%
Large Graphs
100%
Minor-closed
33%
Perfect Hash Functions
33%
Planar Graph
66%
Polynomial Time
33%
Randomized Algorithms
33%
Randomized Methods
33%
Simple Cycle
100%
Simple Path
100%
Small Subgraphs
100%
Mathematics
Hash Function
50%
Multiplication of Matrix
50%
Planar Graph
100%
Polynomial Time
50%
Worst Case
100%