https://hackerpaper.kaipfister.de/p/0911.5703/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=19332621urn:hackerpapers:mention:0911.5703:19332621Thu, 07 Mar 2019 21:24:33 GMT<p>This will not yield a minimal set; in a cycle, it is only necessary to remove at least one word. The problem is thus to delete the minimum number of vertices to remove all cycles. This is the NP-hard Feedback Vertex Set problem. Here&#x27;s a paper that solves it for a dictionary (there is some more): https://arxiv.org/abs/0911.5703</p><p><a href="https://hackerpaper.kaipfister.de/p/0911.5703/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.CL