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. 2206.01506
  4. Cited By
Can Hybrid Geometric Scattering Networks Help Solve the Maximum Clique
  Problem?

Can Hybrid Geometric Scattering Networks Help Solve the Maximum Clique Problem?

3 June 2022
Yimeng Min
Frederik Wenkel
Michael Perlmutter
Guy Wolf
    GNN
ArXivPDFHTML

Papers citing "Can Hybrid Geometric Scattering Networks Help Solve the Maximum Clique Problem?"

3 / 3 papers shown
Title
Tackling Prevalent Conditions in Unsupervised Combinatorial
  Optimization: Cardinality, Minimum, Covering, and More
Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More
Fanchen Bu
Hyeonsoo Jo
Soo Yong Lee
Sungsoo Ahn
Kijung Shin
22
3
0
14 May 2024
A Short Review on Novel Approaches for Maximum Clique Problem: from
  Classical algorithms to Graph Neural Networks and Quantum algorithms
A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms
Raffaele Marino
L. Buffoni
Bogdan Zavalnij
GNN
40
5
0
13 Mar 2024
Geometric Scattering on Measure Spaces
Geometric Scattering on Measure Spaces
Joyce A. Chew
M. Hirn
Smita Krishnaswamy
Deanna Needell
Michael Perlmutter
H. Steach
Siddharth Viswanath
Hau‐Tieng Wu
GNN
39
16
0
17 Aug 2022
1