Color-coding: A new method for finding simple paths, cycles and other small subgraphs within large graphs

Keyphrases

• Color Coding 100%
• Simple Cycle 100%
• Large Graphs 100%
• Small Subgraphs 100%
• Simple Paths 100%
• Planar Graph 66%
• Expected Time 66%
• Polynomial Time 33%
• Randomized Algorithms 33%
• Minor-closed 33%
• Graph Families 33%
• Exponent of Matrix multiplication 33%
• Randomized Methods 33%
• Bounded Treewidth Graphs 33%
• Encoding Method 33%
• Perfect Hash Function 33%

Mathematics

• Worst Case 100%
• Planar Graph 100%
• Polynomial Time 50%
• Hash Function 50%
• Multiplication of Matrix 50%