CliSAT: A new exact algorithm for hard maximum clique problems
Research article (European Journal of Operational Research, 2022) · cited 12× · AI/ML
Press Enter · cited answer in seconds
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Direct Wikidata claims
- [2] ↑ CliSAT: A new exact algorithm for hard maximum clique problems — instance of (P31): scholarly article. wikidata.org.
Class ancestry
📑 Cite this page
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA
4ort.xyz Knowledge Graph. (2026). CliSAT: A new exact algorithm for hard maximum clique problems. Retrieved May 24, 2026, from https://4ort.xyz/entity/clisat-a-new-exact-algorithm-for-hard-maximum-clique-problems
MLA
“CliSAT: A new exact algorithm for hard maximum clique problems.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/clisat-a-new-exact-algorithm-for-hard-maximum-clique-problems.
BibTeX
@misc{4ortxyz_clisat-a-new-exact-algorithm-for-hard-maximum-clique-problems_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{CliSAT: A new exact algorithm for hard maximum clique problems}}, year = {2026}, url = {https://4ort.xyz/entity/clisat-a-new-exact-algorithm-for-hard-maximum-clique-problems}, note = {Accessed: 2026-05-24}}
LLM prompt
According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): CliSAT: A new exact algorithm for hard maximum clique problems — https://4ort.xyz/entity/clisat-a-new-exact-algorithm-for-hard-maximum-clique-problems (retrieved 2026-05-24)
Canonical URL: https://4ort.xyz/entity/clisat-a-new-exact-algorithm-for-hard-maximum-clique-problems · Last refreshed: