Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning

Keyphrases

• Graph-based Machine Learning 100%
• Dense Random Graphs 100%
• Planted Dense Subgraph 100%
• Polynomial Time 66%
• Dense Subgraphs 66%
• Multiple Methods 33%
• Learning Algorithm 33%
• Learning Tools 33%
• Directed Graph 33%
• Neural Network 33%
• Graph Structure 33%
• Undirected Graph 33%
• Network Algorithms 33%
• PAC Learning 33%
• Graph Neural Network 33%
• P-graph 33%
• Planted Clique 33%
• Logarithmic Size 33%

Mathematics

• Clique 100%
• Random Graph 100%
• Polynomial Time 100%
• Neural Network 50%