Maximum independent sets and supervised learning
From MaRDI portal
Publication:6151016
Recommendations
- A new heuristic algorithm to solve the maximum independent set problem
- Extending the MAX algorithm for maximum independent set
- A simple algorithm to optimize maximum
- A differentiable approach to the maximum independent set problem using dataless neural networks
- A polytime preprocess algorithm for the maximum independent set problem
Cites work
- scientific article; zbMATH DE number 3823850 (Why is no real title available?)
- scientific article; zbMATH DE number 1865936 (Why is no real title available?)
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- A fast algorithm for the maximum clique problem
- A new table of permutation codes
- A review on algorithms for maximum clique problems
- An exact algorithm for the maximum clique problem
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
- Conflict propagation and component recursion for canonical labeling
- Fast local search for the maximum independent set problem
- Lower bounds for fixed spectrum frequency assignment
- Permutation codes with specified packing radius
- Practical graph isomorphism. II.
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- Reactive local search for the maximum clique problem
Cited in
(1)
This page was built for publication: Maximum independent sets and supervised learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151016)