Maximum independent sets and supervised learning

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)

zbMATH Keywords

graph theory; machine learning; maximum clique problem; maximum independent set problem

Mathematics Subject Classification ID

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

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