Finding frequent patterns in a large sparse graph

Keyphrases

• Frequent Patterns 100%
• Edge-disjoint 100%
• Large Sparse Graphs 100%
• Disjoint Embeddings 100%
• Sparse Graphs 50%
• Vertical Pattern 50%
• Pattern Discovery 50%
• Performance Scale 50%
• Number of Edges 50%
• Set Computation 50%
• Maximum Independent Set 50%
• Horizontal Pattern 50%
• Sparse Input 50%
• Connected Subgraphs 50%

Computer Science

• Subgraphs 100%
• Frequent Patterns 100%
• Pattern Discovery 50%
• Connected Subgraph 50%
• Good Performance 50%
• Sufficient Number 50%
• Independent Set 50%