Maximum independent sets and supervised learning
From MaRDI portal
Publication:6151016
DOI10.1007/s40305-022-00395-8MaRDI QIDQ6151016
Derek H. Smith, Roberto Montemanni, Xiaochen Chou
Publication date: 9 February 2024
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Permutation codes with specified packing radius
- Fast local search for the maximum independent set problem
- A new table of permutation codes
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
- An exact algorithm for the maximum clique problem
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- Lower bounds for fixed spectrum frequency assignment
- A fast algorithm for the maximum clique problem
- Practical graph isomorphism. II.
- A review on algorithms for maximum clique problems
- Conflict Propagation and Component Recursion for Canonical Labeling
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- Reactive local search for the maximum clique problem
This page was built for publication: Maximum independent sets and supervised learning
