Home ›
Entities
› academia
› Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set
Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set
Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set
Summary
Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set is a scholarly article[1].
Key Facts
Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set's instance of is recorded as scholarly article[2].
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
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). Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set. Retrieved May 24, 2026, from https://4ort.xyz/entity/modern-graph-neural-networks-do-worse-than-classical-greedy-algorithms-in-solving-combinatorial-optimization-problems-li
MLA“Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/modern-graph-neural-networks-do-worse-than-classical-greedy-algorithms-in-solving-combinatorial-optimization-problems-li.
BibTeX@misc{4ortxyz_modern-graph-neural-networks-do-worse-than-classical-greedy-algorithms-in-solving-combinatorial-optimization-problems-li_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set}}, year = {2026}, url = {https://4ort.xyz/entity/modern-graph-neural-networks-do-worse-than-classical-greedy-algorithms-in-solving-combinatorial-optimization-problems-li}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set — https://4ort.xyz/entity/modern-graph-neural-networks-do-worse-than-classical-greedy-algorithms-in-solving-combinatorial-optimization-problems-li (retrieved 2026-05-24)
