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). Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling. Retrieved May 24, 2026, from https://4ort.xyz/entity/computing-a-near-maximum-independent-set-in-linear-time-by-reducing-peeling
MLA“Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/computing-a-near-maximum-independent-set-in-linear-time-by-reducing-peeling.
BibTeX@misc{4ortxyz_computing-a-near-maximum-independent-set-in-linear-time-by-reducing-peeling_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling}}, year = {2026}, url = {https://4ort.xyz/entity/computing-a-near-maximum-independent-set-in-linear-time-by-reducing-peeling}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling — https://4ort.xyz/entity/computing-a-near-maximum-independent-set-in-linear-time-by-reducing-peeling (retrieved 2026-05-24)
