<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Drawing Large Graphs by Multilevel Maxent-Stress Optimization · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1506.04383/</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/1506.04383/feed.xml" rel="self" type="application/rss+xml" /><item><title>Drawing Large Graphs by Multilevel Maxent-Stress Optimization — mentioned by MurrayHill1980</title><link>https://news.ycombinator.com/item?id=15026909</link><guid isPermaLink="false">urn:hackerpapers:mention:1506.04383:15026909</guid><pubDate>Wed, 16 Aug 2017 12:28:22 GMT</pubDate><description>&lt;p&gt;Graphistry is impressive, but not free, and needs their server and an API key. You probably already know about graphviz sfdp (not interactive). There&amp;#x27;s been interesting recent work on distributed maxent optimization https://arxiv.org/pdf/1506.04383.pdf and sparse stress models https://arxiv.org/abs/1608.08909 (see its references as well, for example, Khoury&amp;#x27;s MARS is still available at https://github.com/marckhoury/mars). This problem requires a ton of algorithm engineering, a lot of messy user interface engineering, and integration into an HPC environment is a big issue, so progress in open…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1506.04383/"&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>
