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. 2008.05180
  4. Cited By
Boosting Data Reduction for the Maximum Weight Independent Set Problem
  Using Increasing Transformations
v1v2 (latest)

Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations

12 August 2020
A. Gellner
S. Lamm
Christian Schulz
Darren Strash
Bogdán Zaválnij
ArXiv (abs)PDFHTML

Papers citing "Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations"

3 / 3 papers shown
Title
Dynamic Location Search for Identifying Maximum Weighted Independent Sets in Complex Networks
Dynamic Location Search for Identifying Maximum Weighted Independent Sets in Complex Networks
Enqiang Zhu
Chenkai Hao
Chanjuan Liu
Yongsheng Rao
143
0
0
07 May 2025
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
102
4
0
13 Mar 2024
Improved Exact and Heuristic Algorithms for Maximum Weight Clique
Improved Exact and Heuristic Algorithms for Maximum Weight Clique
Roman Erhardt
Kathrin Hanauer
Nils Kriege
Christian Schulz
Darren Strash
34
0
0
01 Feb 2023
1