<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Shared-memory Exact Minimum Cuts · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1808.05458/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1808.05458/feed.xml" rel="self" type="application/rss+xml" /><item><title>Shared-memory Exact Minimum Cuts — mentioned by 0x23</title><link>https://news.ycombinator.com/item?id=25726423</link><guid isPermaLink="false">urn:hackerpapers:mention:1808.05458:25726423</guid><pubDate>Mon, 11 Jan 2021 08:58:37 GMT</pubDate><description>&lt;p&gt;On that note, here is the currently fastest implementation for the problem https://arxiv.org/abs/1808.05458 and here on github https://github.com/viecut/viecut&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1808.05458/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
