Maximum independent sets and supervised learning
From MaRDI portal
Publication:6151016
DOI10.1007/S40305-022-00395-8MaRDI QIDQ6151016FDOQ6151016
Authors: Roberto Montemanni, Derek H. Smith, Xiaochen Chou 
Publication date: 9 February 2024
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
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
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Practical graph isomorphism. II.
- A fast algorithm for the maximum clique problem
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- Title not available (Why is that?)
- A review on algorithms for maximum clique problems
- Reactive local search for the maximum clique problem
- An exact algorithm for the maximum clique problem
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- Title not available (Why is that?)
- Fast local search for the maximum independent set problem
- Permutation codes with specified packing radius
- A new table of permutation codes
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
- Lower bounds for fixed spectrum frequency assignment
- Conflict propagation and component recursion for canonical labeling
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)
