Reproduce “Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Paweł Rzążewski
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.