<?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/user/schmitz/graphtheory"><title>BibSonomy bookmarks for /user/schmitz/graphtheory</title><link>https://www.bibsonomy.org/user/schmitz/graphtheory</link><description>BibSonomy RSS Feed for /user/schmitz/graphtheory</description><items><rdf:Seq><rdf:li rdf:resource="https://www.cs.cornell.edu/home/kleinber/networks-book/"/><rdf:li rdf:resource="http://visone.info/"/><rdf:li rdf:resource="https://projects.forked.de/graph-tool/wiki/GraphToolGuide"/><rdf:li rdf:resource="http://www.fyslab.hut.fi/~sdo/"/><rdf:li rdf:resource="http://homer.informatics.indiana.edu/~nan/webgraph/"/><rdf:li rdf:resource="http://jgaa.info/"/><rdf:li rdf:resource="https://networkx.lanl.gov/wiki"/><rdf:li rdf:resource="http://greco.phys2.uniroma1.it/~gcalda/docs/book.pdf"/><rdf:li rdf:resource="http://vlado.fmf.uni-lj.si/pub/networks/pajek/howto/text2pajek.htm"/><rdf:li rdf:resource="http://www.springerlink.com/content/978-3-540-22354-2/?p=244272c6a6e44eeeb57e9f84c77ecdaa&amp;pi=52"/><rdf:li rdf:resource="http://www.db.dk/lb/phd/toc.htm"/><rdf:li rdf:resource="http://glaros.dtc.umn.edu/gkhome/views/metis"/><rdf:li rdf:resource="http://www.stat.washington.edu/raftery/"/><rdf:li rdf:resource="http://www.cs.toronto.edu/~molloy/webpapers/papers.html"/><rdf:li rdf:resource="http://www.math.chalmers.se/~ossa/"/><rdf:li rdf:resource="http://www.inf.uni-konstanz.de/~brandes/"/><rdf:li rdf:resource="http://www.pupress.princeton.edu/titles/8114.html"/><rdf:li rdf:resource="http://www.maa.org/reviews/combinatoricsgraphs.html"/><rdf:li rdf:resource="http://www.boost.org/libs/libraries.htm"/><rdf:li rdf:resource="http://www.boost.org/"/></rdf:Seq></items></channel><item rdf:about="https://www.cs.cornell.edu/home/kleinber/networks-book/"><title>Networks, Crowds, and Markets: A Book by David Easley and Jon Kleinberg</title><description>In recent years there has been a growing public fascination with the complex &#034;connectedness&#034; of modern society. This connectedness is found in many incarnations: in the rapid growth of the Internet and the Web, in the ease with which global communication now takes place, and in the ability of news and information as well as epidemics and financial crises to spread around the world with surprising speed and intensity. These are phenomena that involve networks, incentives, and the aggregate behavior of groups of people; they are based on the links that connect us and the ways in which each of our decisions can have subtle consequences for the outcomes of everyone else.

Networks, Crowds, and Markets combines different scientific perspectives in its approach to understanding networks and behavior. Drawing on ideas from economics, sociology, computing and information science, and applied mathematics, it describes the emerging field of study that is growing at the interface of all these areas, addressing fundamental questions about how the social, economic, and technological worlds are connected.

The book is based on an inter-disciplinary course that we teach at Cornell. The book, like the course, is designed at the introductory undergraduate level with no formal prerequisites. To support deeper explorations, most of the chapters are supplemented with optional advanced sections. </description><link>https://www.cs.cornell.edu/home/kleinber/networks-book/</link><dc:creator>schmitz</dc:creator><dc:date>2014-04-02T22:13:55+02:00</dc:date><dc:subject>graph graphtheory kleinberg network sna socialnetworkanalysis </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;In recent years there has been a growing public fascination with the complex &amp;#034;connectedness&amp;#034; of modern society. This connectedness is found in many incarnations: in the rapid growth of the Internet and the Web, in the ease with which global communication now takes place, and in the ability of news and information as well as epidemics and financial crises to spread around the world with surprising speed and intensity. These are phenomena that involve networks, incentives, and the aggregate behavior of groups of people; they are based on the links that connect us and the ways in which each of our decisions can have subtle consequences for the outcomes of everyone else.

Networks, Crowds, and Markets combines different scientific perspectives in its approach to understanding networks and behavior. Drawing on ideas from economics, sociology, computing and information science, and applied mathematics, it describes the emerging field of study that is growing at the interface of all these areas, addressing fundamental questions about how the social, economic, and technological worlds are connected.

The book is based on an inter-disciplinary course that we teach at Cornell. The book, like the course, is designed at the introductory undergraduate level with no formal prerequisites. To support deeper explorations, most of the chapters are supplemented with optional advanced sections. &lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphtheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/kleinberg"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/sna"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/socialnetworkanalysis"/></rdf:Bag></taxo:topics></item><item rdf:about="http://visone.info/"><title>Visone</title><description></description><link>http://visone.info/</link><dc:creator>schmitz</dc:creator><dc:date>2009-10-21T08:13:52+02:00</dc:date><dc:subject>graphtheory network sna software </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2009-10-21T08:13:52+02:00&#034; href=&#034;http://visone.info/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://visone.info/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphtheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/sna"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/software"/></rdf:Bag></taxo:topics></item><item rdf:about="https://projects.forked.de/graph-tool/wiki/GraphToolGuide"><title>GraphToolGuide - graph-tool - Trac</title><description></description><link>https://projects.forked.de/graph-tool/wiki/GraphToolGuide</link><dc:creator>schmitz</dc:creator><dc:date>2007-08-15T17:46:11+02:00</dc:date><dc:subject>download graph graphtheory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2007-08-15T17:46:11+02:00&#034; href=&#034;https://projects.forked.de/graph-tool/wiki/GraphToolGuide&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://projects.forked.de/graph-tool/wiki/GraphToolGuide&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/download"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphtheory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.fyslab.hut.fi/~sdo/"><title>Sergey Dorogovtsev</title><description></description><link>http://www.fyslab.hut.fi/~sdo/</link><dc:creator>schmitz</dc:creator><dc:date>2007-06-29T09:05:25+02:00</dc:date><dc:subject>book free graphtheory network smallworld sna ultrasmallworld </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2007-06-29T09:05:25+02:00&#034; href=&#034;http://www.fyslab.hut.fi/~sdo/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.fyslab.hut.fi/~sdo/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/book"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/free"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphtheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/smallworld"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/sna"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ultrasmallworld"/></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>schmitz</dc:creator><dc:date>2007-01-29T13:04:34+01:00</dc:date><dc:subject>graphtheory graph library boost sna </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2007-01-29T13:04:34+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/graphtheory"/><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/boost"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/sna"/></rdf:Bag></taxo:topics></item><item rdf:about="http://jgaa.info/"><title>Journal of Graph Algorithms and Applications</title><description></description><link>http://jgaa.info/</link><dc:creator>schmitz</dc:creator><dc:date>2007-01-03T17:08:59+01:00</dc:date><dc:subject>algorithm graphtheory journal </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2007-01-03T17:08:59+01:00&#034; href=&#034;http://jgaa.info/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://jgaa.info/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithm"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphtheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/journal"/></rdf:Bag></taxo:topics></item><item rdf:about="https://networkx.lanl.gov/wiki"><title>NetworkX trac - Trac</title><description></description><link>https://networkx.lanl.gov/wiki</link><dc:creator>schmitz</dc:creator><dc:date>2006-12-13T15:57:52+01:00</dc:date><dc:subject>graphtheory python sna </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-12-13T15:57:52+01:00&#034; href=&#034;https://networkx.lanl.gov/wiki&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://networkx.lanl.gov/wiki&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphtheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/python"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/sna"/></rdf:Bag></taxo:topics></item><item rdf:about="http://greco.phys2.uniroma1.it/~gcalda/docs/book.pdf"><title>Scale Free Networks</title><description></description><link>http://greco.phys2.uniroma1.it/~gcalda/docs/book.pdf</link><dc:creator>schmitz</dc:creator><dc:date>2006-10-20T11:50:06+02:00</dc:date><dc:subject>book caldarelli graphtheory network scalefree </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-10-20T11:50:06+02:00&#034; href=&#034;http://greco.phys2.uniroma1.it/~gcalda/docs/book.pdf&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://greco.phys2.uniroma1.it/~gcalda/docs/book.pdf&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/book"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/caldarelli"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphtheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/scalefree"/></rdf:Bag></taxo:topics></item><item rdf:about="http://vlado.fmf.uni-lj.si/pub/networks/pajek/howto/text2pajek.htm"><title>Pajek / How to: Convert text file datasets into Pajek format</title><description></description><link>http://vlado.fmf.uni-lj.si/pub/networks/pajek/howto/text2pajek.htm</link><dc:creator>schmitz</dc:creator><dc:date>2006-09-28T10:14:54+02:00</dc:date><dc:subject>converter csv dataset graphtheory pajek </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-09-28T10:14:54+02:00&#034; href=&#034;http://vlado.fmf.uni-lj.si/pub/networks/pajek/howto/text2pajek.htm&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://vlado.fmf.uni-lj.si/pub/networks/pajek/howto/text2pajek.htm&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/converter"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/csv"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/dataset"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphtheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/pajek"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.springerlink.com/content/978-3-540-22354-2/?p=244272c6a6e44eeeb57e9f84c77ecdaa&amp;pi=52"><title>Complex Networks</title><description></description><link>http://www.springerlink.com/content/978-3-540-22354-2/?p=244272c6a6e44eeeb57e9f84c77ecdaa&amp;pi=52</link><dc:creator>schmitz</dc:creator><dc:date>2006-09-14T17:06:36+02:00</dc:date><dc:subject>book complex graphtheory network sna </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-09-14T17:06:36+02:00&#034; href=&#034;http://www.springerlink.com/content/978-3-540-22354-2/?p=244272c6a6e44eeeb57e9f84c77ecdaa&amp;amp;pi=52&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.springerlink.com/content/978-3-540-22354-2/?p=244272c6a6e44eeeb57e9f84c77ecdaa&amp;amp;pi=52&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/book"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complex"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphtheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/sna"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.db.dk/lb/phd/toc.htm"><title>PhD thesis in webometrics: Table of contents: Small-World Link Structures</title><description></description><link>http://www.db.dk/lb/phd/toc.htm</link><dc:creator>schmitz</dc:creator><dc:date>2006-09-06T10:37:48+02:00</dc:date><dc:subject>björneborn graphtheory network phdthesis researcher smallworld sna </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-09-06T10:37:48+02:00&#034; href=&#034;http://www.db.dk/lb/phd/toc.htm&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.db.dk/lb/phd/toc.htm&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/björneborn"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphtheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/phdthesis"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/researcher"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/smallworld"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/sna"/></rdf:Bag></taxo:topics></item><item rdf:about="http://glaros.dtc.umn.edu/gkhome/views/metis"><title>METIS - Family of Multilevel Partitioning Algorithms | Karypis Lab</title><description></description><link>http://glaros.dtc.umn.edu/gkhome/views/metis</link><dc:creator>schmitz</dc:creator><dc:date>2006-09-06T10:37:30+02:00</dc:date><dc:subject>clustering karypis graphtheory graph metis partitioning algorithm researcher </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-09-06T10:37:30+02:00&#034; href=&#034;http://glaros.dtc.umn.edu/gkhome/views/metis&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://glaros.dtc.umn.edu/gkhome/views/metis&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/clustering"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/karypis"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphtheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/metis"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/partitioning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithm"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/researcher"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.stat.washington.edu/raftery/"><title>Adrian E. Raftery</title><description></description><link>http://www.stat.washington.edu/raftery/</link><dc:creator>schmitz</dc:creator><dc:date>2006-09-06T10:37:30+02:00</dc:date><dc:subject>clustering graphtheory raftery researcher sna </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-09-06T10:37:30+02:00&#034; href=&#034;http://www.stat.washington.edu/raftery/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.stat.washington.edu/raftery/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/clustering"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphtheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/raftery"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/researcher"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/sna"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.toronto.edu/~molloy/webpapers/papers.html"><title>Mike Molloy&#039;s papers</title><description></description><link>http://www.cs.toronto.edu/~molloy/webpapers/papers.html</link><dc:creator>schmitz</dc:creator><dc:date>2006-09-06T10:37:30+02:00</dc:date><dc:subject>graphtheory researcher sna </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-09-06T10:37:30+02:00&#034; href=&#034;http://www.cs.toronto.edu/~molloy/webpapers/papers.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.cs.toronto.edu/~molloy/webpapers/papers.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphtheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/researcher"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/sna"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.math.chalmers.se/~ossa/"><title>oskar sandberg</title><description></description><link>http://www.math.chalmers.se/~ossa/</link><dc:creator>schmitz</dc:creator><dc:date>2006-09-06T10:37:30+02:00</dc:date><dc:subject>graphtheory routing network researcher sna </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-09-06T10:37:30+02:00&#034; href=&#034;http://www.math.chalmers.se/~ossa/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.math.chalmers.se/~ossa/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphtheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/routing"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/researcher"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/sna"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.inf.uni-konstanz.de/~brandes/"><title>Ulrik Brandes</title><description></description><link>http://www.inf.uni-konstanz.de/~brandes/</link><dc:creator>schmitz</dc:creator><dc:date>2006-09-06T10:37:30+02:00</dc:date><dc:subject>analysis graphtheory network researcher </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-09-06T10:37:30+02:00&#034; href=&#034;http://www.inf.uni-konstanz.de/~brandes/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.inf.uni-konstanz.de/~brandes/&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/graphtheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/researcher"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.pupress.princeton.edu/titles/8114.html"><title>Newman, M., Barabási, A., Watts, D.J.: The Structure and Dynamics of Networks.</title><description></description><link>http://www.pupress.princeton.edu/titles/8114.html</link><dc:creator>schmitz</dc:creator><dc:date>2006-09-06T10:34:37+02:00</dc:date><dc:subject>barabasi book graphtheory network newman sna watts </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-09-06T10:34:37+02:00&#034; href=&#034;http://www.pupress.princeton.edu/titles/8114.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.pupress.princeton.edu/titles/8114.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/barabasi"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/book"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphtheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/newman"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/sna"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/watts"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.maa.org/reviews/combinatoricsgraphs.html"><title>Read This: Combinatorics and Graph Theory</title><description></description><link>http://www.maa.org/reviews/combinatoricsgraphs.html</link><dc:creator>schmitz</dc:creator><dc:date>2006-09-01T10:29:57+02:00</dc:date><dc:subject>book combinatoric graphtheory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-09-01T10:29:57+02:00&#034; href=&#034;http://www.maa.org/reviews/combinatoricsgraphs.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.maa.org/reviews/combinatoricsgraphs.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/book"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/combinatoric"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphtheory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.boost.org/libs/libraries.htm"><title>Boost Libraries</title><description></description><link>http://www.boost.org/libs/libraries.htm</link><dc:creator>schmitz</dc:creator><dc:date>2006-07-13T13:12:07+02:00</dc:date><dc:subject>graphtheory documentation graph library boost c** reference </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-07-13T13:12:07+02:00&#034; href=&#034;http://www.boost.org/libs/libraries.htm&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.boost.org/libs/libraries.htm&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphtheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/documentation"/><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/boost"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/c**"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/reference"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.boost.org/"><title>Boost C++ Libraries</title><description></description><link>http://www.boost.org/</link><dc:creator>schmitz</dc:creator><dc:date>2006-07-13T11:52:01+02:00</dc:date><dc:subject>graphtheory graph library boost c** </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-07-13T11:52:01+02:00&#034; href=&#034;http://www.boost.org/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.boost.org/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphtheory"/><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/boost"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/c**"/></rdf:Bag></taxo:topics></item></rdf:RDF>