<node id="155151">
  <nid>155151</nid>
  <type>external_news</type>
  <uid>
    <user id="27556"><![CDATA[27556]]></user>
  </uid>
  <created>1347970243</created>
  <changed>1475893557</changed>
  <title><![CDATA[Georgia Tech Develops New Graph Algorithm]]></title>
  <body><![CDATA[<p>Georgia Tech has developed a new algorithm that quickly determines betweenness centrality for streaming graphs. “Unlike existing algorithms, our system doesn’t restart the computational process from scratch each time a new edge is inserted into a graph,” said David Bader (<em>Comp Sci &amp; Eng). Source: HPCwire</em></p>]]></body>
  <field_article_url>
    <item>
      <url><![CDATA[http://www.hpcwire.com/hpcwire/2012-09-10/georgia_tech_develops_new_graph_algorithm.html]]></url>
      <title><![CDATA[]]></title>
    </item>
  </field_article_url>
  <field_publication>
    <item>
      <value><![CDATA[ Brett Aiello ]]></value>
    </item>
  </field_publication>
  <field_dateline>
    <item>
      <value>2012-09-11</value>
      <timezone></timezone>
    </item>
  </field_dateline>
  <field_media>
        </field_media>
  <og_groups>
          <item>47223</item>
          <item>50877</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[College of Computing]]></item>
          <item><![CDATA[School of Computational Science and Engineering]]></item>
      </og_groups_both>
    <field_userdata>
      <![CDATA[]]>
  </field_userdata>
</node>
