Reproduce “Thick Forests” 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
Martin Dyer, Haiko Müller
The authors give a polynomial-time algorithm to recognize thick forests and construct thin forest representations. It recursively uses local clique neighborhoods and repairs ambiguities along paths in the hidden tree. The algorithm runs in O(mn) time, where n and m are the input’s vertices and edges. This result does not extend to thick graphs generally, whose recognition can be NP-complete.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.