ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2201.01825
  4. Cited By
Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using
  Graph-based Machine Learning

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

5 January 2022
Itay Levinas
Y. Louzoun
ArXivPDFHTML

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

1 / 1 papers shown
Title
Modern graph neural networks do worse than classical greedy algorithms
  in solving combinatorial optimization problems like maximum independent set
Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set
Maria Chiara Angelini
F. Ricci-Tersenghi
GNN
AI4CE
11
30
0
27 Jun 2022
1