<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/tag/webgraph"><title>BibSonomy bookmarks for /tag/webgraph</title><link>https://www.bibsonomy.org/tag/webgraph</link><description>BibSonomy RSS Feed for /tag/webgraph</description><items><rdf:Seq><rdf:li rdf:resource="http://webgraph.di.unimi.it/"/><rdf:li rdf:resource="http://www.lemurproject.org/clueweb12/webgraph.php/"/><rdf:li rdf:resource="http://webgraph.di.unimi.it/"/><rdf:li rdf:resource="http://www.aharef.info"/><rdf:li rdf:resource="http://wiki.apache.org/nutch/NewScoring#LinkRank"/><rdf:li rdf:resource="http://webgraph.dsi.unimi.it/"/><rdf:li rdf:resource="http://homer.informatics.indiana.edu/~nan/webgraph/"/><rdf:li rdf:resource="http://www9.org/w9cdrom/160/160.html"/></rdf:Seq></items></channel><item rdf:about="http://webgraph.di.unimi.it/"><title>WebGraph</title><description></description><link>http://webgraph.di.unimi.it/</link><dc:creator>jaeschke</dc:creator><dc:date>2016-11-03T16:18:07+01:00</dc:date><dc:subject>analysis compression framework graph library network programming web webgraph </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2016-11-03T16:18:07+01:00&#034; href=&#034;http://webgraph.di.unimi.it/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://webgraph.di.unimi.it/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/analysis"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/compression"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/framework"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/library"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/web"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/webgraph"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.lemurproject.org/clueweb12/webgraph.php/"><title>ClueWeb12 Web Graph: Web Graph</title><description></description><link>http://www.lemurproject.org/clueweb12/webgraph.php/</link><dc:creator>thoni</dc:creator><dc:date>2014-04-09T05:31:14+02:00</dc:date><dc:subject>clueweb crawl web webgraph </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2014-04-09T05:31:14+02:00&#034; href=&#034;http://www.lemurproject.org/clueweb12/webgraph.php/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.lemurproject.org/clueweb12/webgraph.php/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/clueweb"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/crawl"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/web"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/webgraph"/></rdf:Bag></taxo:topics></item><item rdf:about="http://webgraph.di.unimi.it/"><title>WebGraph</title><description></description><link>http://webgraph.di.unimi.it/</link><dc:creator>thoni</dc:creator><dc:date>2014-04-09T05:29:47+02:00</dc:date><dc:subject>toolkit webgraph </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2014-04-09T05:29:47+02:00&#034; href=&#034;http://webgraph.di.unimi.it/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://webgraph.di.unimi.it/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/toolkit"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/webgraph"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.aharef.info"><title>Aharef </title><description>online webgraph plotter</description><link>http://www.aharef.info</link><dc:creator>ilativ</dc:creator><dc:date>2012-02-26T23:20:32+01:00</dc:date><dc:subject>crawler kde online projekt webgraph ws12 </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;online webgraph plotter&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/crawler"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/kde"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/online"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/projekt"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/webgraph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ws12"/></rdf:Bag></taxo:topics></item><item rdf:about="http://wiki.apache.org/nutch/NewScoring#LinkRank"><title>NewScoring - Nutch Wiki</title><description></description><link>http://wiki.apache.org/nutch/NewScoring#LinkRank</link><dc:creator>telekoma</dc:creator><dc:date>2011-10-15T14:49:33+02:00</dc:date><dc:subject>arbeit linkrank nutch scoring suchmaschinen uni webgraph </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-10-15T14:49:33+02:00&#034; href=&#034;http://wiki.apache.org/nutch/NewScoring#LinkRank&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://wiki.apache.org/nutch/NewScoring#LinkRank&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/arbeit"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/linkrank"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/nutch"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/scoring"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/suchmaschinen"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/uni"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/webgraph"/></rdf:Bag></taxo:topics></item><item rdf:about="http://webgraph.dsi.unimi.it/"><title>WebGraph</title><description></description><link>http://webgraph.dsi.unimi.it/</link><dc:creator>dolefulrabbit</dc:creator><dc:date>2007-01-29T10:13:40+01:00</dc:date><dc:subject>algorithms graph java networks webgraph </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2007-01-29T10:13:40+01:00&#034; href=&#034;http://webgraph.dsi.unimi.it/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://webgraph.dsi.unimi.it/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/java"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/networks"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/webgraph"/></rdf:Bag></taxo:topics></item><item rdf:about="http://homer.informatics.indiana.edu/~nan/webgraph/"><title>webgraph++</title><description></description><link>http://homer.informatics.indiana.edu/~nan/webgraph/</link><dc:creator>dolefulrabbit</dc:creator><dc:date>2007-01-29T10:12:41+01:00</dc:date><dc:subject>c++ free graph library networks software webgraph </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2007-01-29T10:12:41+01:00&#034; href=&#034;http://homer.informatics.indiana.edu/~nan/webgraph/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://homer.informatics.indiana.edu/~nan/webgraph/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/c++"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/free"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/library"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/networks"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/software"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/webgraph"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www9.org/w9cdrom/160/160.html"><title>Graph structure in the web</title><description>The web can be represented by a graph with special regions: SCC, IN, OUT and TENDRILS.
Regions are defined by the link-path-reach from one website to others.
The linkage to and from a website (in- and out-degree) seems to conform the power law, which is also mentioned in this document.</description><link>http://www9.org/w9cdrom/160/160.html</link><dc:creator>jwo</dc:creator><dc:date>2006-05-17T16:12:44+02:00</dc:date><dc:subject>web webgraph graph mining structure </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;The web can be represented by a graph with special regions: SCC, IN, OUT and TENDRILS.
Regions are defined by the link-path-reach from one website to others.
The linkage to and from a website (in- and out-degree) seems to conform the power law, which is also mentioned in this document.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/web"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/webgraph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/mining"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/structure"/></rdf:Bag></taxo:topics></item></rdf:RDF>