<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Graph-Algorithms on Ryan Orban</title><link>https://ryanorban.com/categories/graph-algorithms/</link><description>Recent content in Graph-Algorithms on Ryan Orban</description><generator>Hugo</generator><language>en-us</language><managingEditor>me@ryanorban.com (Ryan Orban)</managingEditor><webMaster>me@ryanorban.com (Ryan Orban)</webMaster><copyright>Ryan Orban</copyright><lastBuildDate>Sun, 31 Mar 2013 00:00:00 +0000</lastBuildDate><atom:link href="https://ryanorban.com/categories/graph-algorithms/index.xml" rel="self" type="application/rss+xml"/><item><title>Sarkar — Graph Processing Paper (CMU AutonLab)</title><link>https://ryanorban.com/notes/sarkar-graph-processing-paper/</link><pubDate>Sun, 31 Mar 2013 00:00:00 +0000</pubDate><author>me@ryanorban.com (Ryan Orban)</author><guid>https://ryanorban.com/notes/sarkar-graph-processing-paper/</guid><description>&lt;p&gt;&lt;img
 src="https://ryanorban.com/images/notes/sarkar-graph-processing-paper.png"
 alt="Sarkar — Graph Processing Paper (CMU AutonLab)" class="note-hero-img"
 loading="lazy"
/&gt;
&lt;/p&gt;
&lt;h3 id="summary" class="scroll-mt-8 group"&gt;
 Summary
 
 &lt;a href="#summary"
 class="no-underline hidden opacity-50 hover:opacity-100 !text-inherit group-hover:inline-block"
 aria-hidden="true" title="Link to this heading" tabindex="-1"&gt;
 &lt;svg
 xmlns="http://www.w3.org/2000/svg"
 width="16"
 height="16"
 fill="none"
 stroke="currentColor"
 stroke-linecap="round"
 stroke-linejoin="round"
 stroke-width="2"
 class="lucide lucide-link w-4 h-4 block"
 viewBox="0 0 24 24"
&gt;
 &lt;path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71" /&gt;
 &lt;path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71" /&gt;
&lt;/svg&gt;

 &lt;/a&gt;
 
&lt;/h3&gt;
&lt;p&gt;This paper from CMU&amp;rsquo;s AutonLab (directed by Artur Dubrawski) by Prithwish Sarkar addresses large-scale graph analysis — likely covering graph-based semi-supervised learning, link prediction, or community detection at scale. The bookmark was saved alongside Apache Giraph (a distributed graph processing framework) in the same Twitter exchange, suggesting it was referenced as theoretical grounding for someone evaluating graph-scale distributed computing approaches.&lt;/p&gt;</description></item></channel></rss>