Maximum Independent Set
Emerging6papers using it
2024first seen
The Maximum Independent Set (MIS) is a combinatorial optimization problem that involves finding the largest set of vertices in a graph such that no two vertices in the set are adjacent, and it is used to evaluate the performance of quantum-enhanced algorithms in solving complex optimization challenges.
Papers using Maximum Independent Set (6)
- Beyond Single Trajectories: Optimal Control and Jordan-Lie Algebra in Hybrid Quantum Walks for Combinatorial OptimizationQuantum-enhanced Markov Chain Monte Carlo for Combinatorial OptimizationQuantum-Enhanced Optimization by Warm StartsAdaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial ProblemsCutting Slack: Quantum Optimization With Slack-free Methods For Combinatorial BenchmarksQuantum Computing for Discrete Optimization: A Highlight of Three Technologies