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.
APA4ort.xyz Knowledge Graph. (2026). Efficient maximum clique computation and enumeration over large sparse graphs. Retrieved May 24, 2026, from https://4ort.xyz/entity/efficient-maximum-clique-computation-and-enumeration-over-large-sparse-graphs
MLA“Efficient maximum clique computation and enumeration over large sparse graphs.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/efficient-maximum-clique-computation-and-enumeration-over-large-sparse-graphs.
BibTeX@misc{4ortxyz_efficient-maximum-clique-computation-and-enumeration-over-large-sparse-graphs_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Efficient maximum clique computation and enumeration over large sparse graphs}}, year = {2026}, url = {https://4ort.xyz/entity/efficient-maximum-clique-computation-and-enumeration-over-large-sparse-graphs}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Efficient maximum clique computation and enumeration over large sparse graphs — https://4ort.xyz/entity/efficient-maximum-clique-computation-and-enumeration-over-large-sparse-graphs (retrieved 2026-05-24)
