We only have this paper's title and publication details.
Read it at the sourceAnswers are grounded in this paper and cite their sources.
This research addresses the maximum independent set problem in circulant graphs, suggesting new algorithms for optimization.
No takes yet. Share an insight, caveat, or question.
Carotenuto et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: