<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>On dynamic succinct graph representations · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1911.03195/</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/1911.03195/feed.xml" rel="self" type="application/rss+xml" /><item><title>On dynamic succinct graph representations — mentioned by faizshah</title><link>https://news.ycombinator.com/item?id=28546594</link><guid isPermaLink="false">urn:hackerpapers:mention:1911.03195:28546594</guid><pubDate>Thu, 16 Sep 2021 01:00:07 GMT</pubDate><description>&lt;p&gt;Is there a good applied overview of succinct data structures for programmers (non CS researchers)? Also I just started researching succinct dynamic graph data structures a few days ago and ended up on a very interesting paper if anyone is interested: https://arxiv.org/abs/1911.03195 Will also add this, lecture introducing succinct data structures: https://youtu.be/3Y2weLDiUWw Ok last edit to this comment but I’m sure someone else will find this useful. I also found a good book (haven’t read it yet, but it doesn&amp;#x27;t seem to have much code examples if any) that covers Succinct Graph data…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1911.03195/"&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>
