<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:cc="http://web.resource.org/cc/" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="http://www.bibsonomy.org/concept/user/schmitz/graph"><title>BibSonomy publications for /concept/user/schmitz/graph</title><link>http://www.bibsonomy.org/publrss/concept/user/schmitz/graph</link><description>BibSonomy RSS Feed for /concept/user/schmitz/graph</description><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/23a49cc3c52a3f5fe1474f822b3f973b0/schmitz"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2db61bde56bc8e7a3ccecc35305b72118/schmitz"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2c86549355475331f563d0a3ba7816dab/schmitz"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/27daae7bfcc64f52e6faa3e4d5d7e12cd/schmitz"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2fb96363fda06e80943498e293c6e402a/schmitz"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/29a69c6cc7772afe370c3de080fa37049/schmitz"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/255e8994016dbd04844be73e3216dc36f/schmitz"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2a08b7937f79ce0cf9854806274e42ee1/schmitz"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/29fb8eef22247ddd394fa9e19512484c1/schmitz"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/271ff9c3b5829fbc195a4c0e45ce26bb1/schmitz"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/24e685792bfb95c46141d38e048a2a785/schmitz"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/218020a2bbb20a933e042fa2d93292a03/schmitz"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2a5b40f4a5123d549488c8570d2fc7b7f/schmitz"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/26a115d530e6d78336c792fdff70d4bf9/schmitz"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/279627cbb167963529e9670f2b9f9b0e3/schmitz"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/21cb05b9777c127e71aab3d6a8538552e/schmitz"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2acff1ece0b3ffe1924413b8e1cbcecf5/schmitz"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/22924bb99ded1d2c9797a9333a852cdf7/schmitz"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/25f5c74d43838240469d9528ca54d8907/schmitz"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/22db65142882eeb46c62ba8e5bd4c045b/schmitz"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/23a49cc3c52a3f5fe1474f822b3f973b0/schmitz"><title>Diffusion Kernels on Graphs and Other Discrete Input Spaces</title><link>http://www.bibsonomy.org/bibtex/23a49cc3c52a3f5fe1474f822b3f973b0/schmitz</link><dc:creator>schmitz</dc:creator><dc:date>2007-06-14T16:14:05+02:00</dc:date><dc:subject>svm kernel graph </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Risi Imre &lt;a href=&#034;http://www.bibsonomy.org/author/Kondor&#034;&gt;Kondor&lt;/a&gt;  and John D. &lt;a href=&#034;http://www.bibsonomy.org/author/Lafferty&#034;&gt;Lafferty&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;ICML &#039;02: Proceedings of the Nineteenth International Conference on Machine Learning, &lt;/em&gt;&lt;em&gt;page315--322. &lt;/em&gt;&lt;em&gt;San Francisco, CA, USA, &lt;/em&gt;&lt;em&gt;Morgan Kaufmann Publishers Inc., &lt;/em&gt;(&lt;em&gt;2002&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/svm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kernel"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2db61bde56bc8e7a3ccecc35305b72118/schmitz"><title>Graphs and Hypergraphs</title><description>Graphs and Hypergraphs</description><link>http://www.bibsonomy.org/bibtex/2db61bde56bc8e7a3ccecc35305b72118/schmitz</link><dc:creator>schmitz</dc:creator><dc:date>2007-05-02T13:59:03+02:00</dc:date><dc:subject>hypergraph graphtheory graph </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Claude &lt;a href=&#034;http://www.bibsonomy.org/author/Berge&#034;&gt;Berge&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Elsevier Science Ltd, &lt;/em&gt;(&lt;em&gt;1985&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/hypergraph"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphtheory"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2c86549355475331f563d0a3ba7816dab/schmitz"><title>Authoritative sources in a hyperlinked environment</title><link>http://www.bibsonomy.org/bibtex/2c86549355475331f563d0a3ba7816dab/schmitz</link><dc:creator>schmitz</dc:creator><dc:date>2007-04-02T19:03:34+02:00</dc:date><dc:subject>hits mining web graph ranking </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Jon M. &lt;a href=&#034;http://www.bibsonomy.org/author/Kleinberg&#034;&gt;Kleinberg&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Journal of the ACM&lt;/em&gt;&lt;em&gt;46(5):604--632&lt;/em&gt;(&lt;em&gt;1999&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/hits"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/web"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ranking"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/27daae7bfcc64f52e6faa3e4d5d7e12cd/schmitz"><title>Hypergraphs</title><link>http://www.bibsonomy.org/bibtex/27daae7bfcc64f52e6faa3e4d5d7e12cd/schmitz</link><dc:creator>schmitz</dc:creator><dc:date>2007-04-02T16:36:42+02:00</dc:date><dc:subject>hypergraph graph graphtheory </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Claude &lt;a href=&#034;http://www.bibsonomy.org/author/Berge&#034;&gt;Berge&lt;/a&gt;  &lt;/span&gt;(&lt;em&gt;1989&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/hypergraph"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphtheory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2fb96363fda06e80943498e293c6e402a/schmitz"><title>Structural Similarity in Graphs (A Relaxation Approach for Role Assignment).</title><description>dblp</description><link>http://www.bibsonomy.org/bibtex/2fb96363fda06e80943498e293c6e402a/schmitz</link><dc:creator>schmitz</dc:creator><dc:date>2007-03-22T18:00:17+01:00</dc:date><dc:subject>similarity metric graph graphtheory distance </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Ulrik &lt;a href=&#034;http://www.bibsonomy.org/author/Brandes&#034;&gt;Brandes&lt;/a&gt;  and J&amp;#252;rgen &lt;a href=&#034;http://www.bibsonomy.org/author/Lerner&#034;&gt;Lerner&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;ISAAC, &lt;/em&gt;&lt;em&gt;volume3341ofLecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page184-195. &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;2004&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/similarity"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/metric"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphtheory"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/distance"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/29a69c6cc7772afe370c3de080fa37049/schmitz"><title>Topology of evolving networks: local events and universality</title><link>http://www.bibsonomy.org/bibtex/29a69c6cc7772afe370c3de080fa37049/schmitz</link><dc:creator>schmitz</dc:creator><dc:date>2007-03-22T17:49:15+01:00</dc:date><dc:subject>barabasi preferentialattachment network mining sna graphtheory graph </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Reka &lt;a href=&#034;http://www.bibsonomy.org/author/Albert&#034;&gt;Albert&lt;/a&gt;  and Albert-Laszlo &lt;a href=&#034;http://www.bibsonomy.org/author/Barabasi&#034;&gt;Barabasi&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Physical Review Letters&lt;/em&gt;(&lt;em&gt;2000&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/barabasi"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/preferentialattachment"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sna"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphtheory"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/255e8994016dbd04844be73e3216dc36f/schmitz"><title>The Boost Graph Library User Guide and Reference Manual (With CD-ROM)</title><description>Amazon.com: The Boost Graph Library User Guide and Reference Manual (With CD-ROM): Books: Jeremy G. Siek,Lie-Quan Lee,Andrew Lumsdaine</description><link>http://www.bibsonomy.org/bibtex/255e8994016dbd04844be73e3216dc36f/schmitz</link><dc:creator>schmitz</dc:creator><dc:date>2006-12-28T17:08:53+01:00</dc:date><dc:subject>programming library graph boost c++ book graphtheory </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Jeremy G. &lt;a href=&#034;http://www.bibsonomy.org/author/Siek&#034;&gt;Siek&lt;/a&gt;  and Lie-Quan &lt;a href=&#034;http://www.bibsonomy.org/author/Lee&#034;&gt;Lee&lt;/a&gt;  and Andrew &lt;a href=&#034;http://www.bibsonomy.org/author/Lumsdaine&#034;&gt;Lumsdaine&lt;/a&gt;  &lt;/span&gt;(&lt;em&gt;2002&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/library"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/boost"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/c++"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/book"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphtheory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2a08b7937f79ce0cf9854806274e42ee1/schmitz"><title>Random Graphs</title><link>http://www.bibsonomy.org/bibtex/2a08b7937f79ce0cf9854806274e42ee1/schmitz</link><dc:creator>schmitz</dc:creator><dc:date>2006-11-20T22:19:05+01:00</dc:date><dc:subject>random graph </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;B. &lt;a href=&#034;http://www.bibsonomy.org/author/Bollobas&#034;&gt;Bollobas&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Cambridge University Press, &lt;/em&gt;(&lt;em&gt;2001&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/random"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/29fb8eef22247ddd394fa9e19512484c1/schmitz"><title>Introspective Subgroup Analysis for Interactive Knowledge Refinement</title><link>http://www.bibsonomy.org/bibtex/29fb8eef22247ddd394fa9e19512484c1/schmitz</link><dc:creator>schmitz</dc:creator><dc:date>2006-10-11T11:58:37+02:00</dc:date><dc:subject>clustering graph mining baumeister </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Martin &lt;a href=&#034;http://www.bibsonomy.org/author/Atzmueller&#034;&gt;Atzmueller&lt;/a&gt;  and Joachim &lt;a href=&#034;http://www.bibsonomy.org/author/Baumeister&#034;&gt;Baumeister&lt;/a&gt;  and Frank &lt;a href=&#034;http://www.bibsonomy.org/author/Puppe&#034;&gt;Puppe&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proc. of the 19th International Florida Artificial Intelligence Research Society Conference (FLAIRS-2006), pp. 402-407, AAAI Press, USA, &lt;/em&gt;(&lt;em&gt;2006&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/clustering"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/baumeister"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/271ff9c3b5829fbc195a4c0e45ce26bb1/schmitz"><title>Robustness as an Evolutionary Principle</title><link>http://www.bibsonomy.org/bibtex/271ff9c3b5829fbc195a4c0e45ce26bb1/schmitz</link><dc:creator>schmitz</dc:creator><dc:date>2006-09-18T11:06:47+02:00</dc:date><dc:subject>graph evolution sna network </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Stefan &lt;a href=&#034;http://www.bibsonomy.org/author/Bornholdt&#034;&gt;Bornholdt&lt;/a&gt;  and Kim &lt;a href=&#034;http://www.bibsonomy.org/author/Sneppen&#034;&gt;Sneppen&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;PROC.R.SOC.LOND.B&lt;/em&gt;(&lt;em&gt;2000&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/evolution"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sna"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/network"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/24e685792bfb95c46141d38e048a2a785/schmitz"><title>Scale-Free Networks from Varying Vertex Intrinsic Fitness</title><link>http://www.bibsonomy.org/bibtex/24e685792bfb95c46141d38e048a2a785/schmitz</link><dc:creator>schmitz</dc:creator><dc:date>2006-09-18T10:23:13+02:00</dc:date><dc:subject>network scalefree graph evolution graphgenerator </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;G. &lt;a href=&#034;http://www.bibsonomy.org/author/Caldarelli&#034;&gt;Caldarelli&lt;/a&gt;  and A. &lt;a href=&#034;http://www.bibsonomy.org/author/Capocci&#034;&gt;Capocci&lt;/a&gt;  and P. &lt;a href=&#034;http://www.bibsonomy.org/author/De Los Rios&#034;&gt;De Los Rios&lt;/a&gt;  and M. A. &lt;a href=&#034;http://www.bibsonomy.org/author/Mu\ noz&#034;&gt;Mu noz&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Phys. Rev. Lett.&lt;/em&gt;&lt;em&gt;89(25):258702&lt;/em&gt;&lt;em&gt;Dec2002. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/scalefree"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/evolution"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphgenerator"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/218020a2bbb20a933e042fa2d93292a03/schmitz"><title>Growing and navigating the small world web by local content</title><link>http://www.bibsonomy.org/bibtex/218020a2bbb20a933e042fa2d93292a03/schmitz</link><dc:creator>schmitz</dc:creator><dc:date>2006-09-15T17:08:49+02:00</dc:date><dc:subject>smallworld graph evolution sna </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;F. &lt;a href=&#034;http://www.bibsonomy.org/author/Menczer&#034;&gt;Menczer&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proceedings of the National Academy of Sciences&lt;/em&gt;&lt;em&gt;99(22):14014--14019&lt;/em&gt;(&lt;em&gt;2002&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/smallworld"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/evolution"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sna"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2a5b40f4a5123d549488c8570d2fc7b7f/schmitz"><title>Velocity and hierarchical spread of epidemic outbreaks in scale-free networks</title><link>http://www.bibsonomy.org/bibtex/2a5b40f4a5123d549488c8570d2fc7b7f/schmitz</link><dc:creator>schmitz</dc:creator><dc:date>2006-09-15T15:01:42+02:00</dc:date><dc:subject>graph clustco sna evolution toread weightedclustco </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Marc &lt;a href=&#034;http://www.bibsonomy.org/author/Barthelemy&#034;&gt;Barthelemy&lt;/a&gt;  and Alain &lt;a href=&#034;http://www.bibsonomy.org/author/Barrat&#034;&gt;Barrat&lt;/a&gt;  and Romualdo &lt;a href=&#034;http://www.bibsonomy.org/author/Pastor-Satorras&#034;&gt;Pastor-Satorras&lt;/a&gt;  and Alessandro &lt;a href=&#034;http://www.bibsonomy.org/author/Vespignani&#034;&gt;Vespignani&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Physical Review Letters&lt;/em&gt;(&lt;em&gt;2004&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/clustco"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sna"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/evolution"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/toread"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/weightedclustco"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/26a115d530e6d78336c792fdff70d4bf9/schmitz"><title>Weighted evolving networks: coupling topology and weights dynamics</title><link>http://www.bibsonomy.org/bibtex/26a115d530e6d78336c792fdff70d4bf9/schmitz</link><dc:creator>schmitz</dc:creator><dc:date>2006-09-15T15:01:37+02:00</dc:date><dc:subject>clustco evolution weightedclustco toread sna graph </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Alain &lt;a href=&#034;http://www.bibsonomy.org/author/Barrat&#034;&gt;Barrat&lt;/a&gt;  and Marc &lt;a href=&#034;http://www.bibsonomy.org/author/Barthelemy&#034;&gt;Barthelemy&lt;/a&gt;  and Alessandro &lt;a href=&#034;http://www.bibsonomy.org/author/Vespignani&#034;&gt;Vespignani&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Physical Review Letters&lt;/em&gt;(&lt;em&gt;2004&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/clustco"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/evolution"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/weightedclustco"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/toread"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sna"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/279627cbb167963529e9670f2b9f9b0e3/schmitz"><title>Clustering in Complex Networks</title><link>http://www.bibsonomy.org/bibtex/279627cbb167963529e9670f2b9f9b0e3/schmitz</link><dc:creator>schmitz</dc:creator><dc:date>2006-09-15T14:21:47+02:00</dc:date><dc:subject>preferentialattachment graph sna network evolution </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;G&amp;#225;bor &lt;a href=&#034;http://www.bibsonomy.org/author/Szabó&#034;&gt;Szab&amp;#243;&lt;/a&gt;  and Mikko &lt;a href=&#034;http://www.bibsonomy.org/author/Alava&#034;&gt;Alava&lt;/a&gt;  and J&amp;#225;nos &lt;a href=&#034;http://www.bibsonomy.org/author/Kertész&#034;&gt;Kert&amp;#233;sz&lt;/a&gt;  &lt;/span&gt;(&lt;em&gt;2004&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/preferentialattachment"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sna"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/evolution"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/21cb05b9777c127e71aab3d6a8538552e/schmitz"><title>Complex Networks and Decentralized Search Algorithms</title><link>http://www.bibsonomy.org/bibtex/21cb05b9777c127e71aab3d6a8538552e/schmitz</link><dc:creator>schmitz</dc:creator><dc:date>2006-09-14T16:56:08+02:00</dc:date><dc:subject>evolution graph kleinberg graphgenerator routing sna </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Jon &lt;a href=&#034;http://www.bibsonomy.org/author/Kleinberg&#034;&gt;Kleinberg&lt;/a&gt;  &lt;/span&gt;(&lt;em&gt;2006&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/evolution"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kleinberg"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphgenerator"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/routing"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sna"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2acff1ece0b3ffe1924413b8e1cbcecf5/schmitz"><title>Small-World Phenomena and the Dynamics of Information.</title><description>dblp</description><link>http://www.bibsonomy.org/bibtex/2acff1ece0b3ffe1924413b8e1cbcecf5/schmitz</link><dc:creator>schmitz</dc:creator><dc:date>2006-09-14T16:06:58+02:00</dc:date><dc:subject>evolution sna graph smallworld </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Jon M. &lt;a href=&#034;http://www.bibsonomy.org/author/Kleinberg&#034;&gt;Kleinberg&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;NIPS, &lt;/em&gt;&lt;em&gt;page431-438. &lt;/em&gt;(&lt;em&gt;2001&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/evolution"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sna"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/smallworld"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/22924bb99ded1d2c9797a9333a852cdf7/schmitz"><title>Small-world internet topologies: Possible causes and implications on scalability of end-system multicast</title><description>Small-World Internet Topologies: Possible Causes and Implications on Scalability of End-System Multicast - Jin, Bestavros (ResearchIndex)</description><link>http://www.bibsonomy.org/bibtex/22924bb99ded1d2c9797a9333a852cdf7/schmitz</link><dc:creator>schmitz</dc:creator><dc:date>2006-09-13T17:58:45+02:00</dc:date><dc:subject>smallworld evolution graph graphgenerator </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;S. &lt;a href=&#034;http://www.bibsonomy.org/author/Jin&#034;&gt;Jin&lt;/a&gt;  and A. &lt;a href=&#034;http://www.bibsonomy.org/author/Bestavros&#034;&gt;Bestavros&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;BUCS-2002-004. &lt;/em&gt;&lt;em&gt;Boston University, &lt;/em&gt;(&lt;em&gt;2002&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/smallworld"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/evolution"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphgenerator"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/25f5c74d43838240469d9528ca54d8907/schmitz"><title>On Power-law Relationships of the Internet Topology</title><link>http://www.bibsonomy.org/bibtex/25f5c74d43838240469d9528ca54d8907/schmitz</link><dc:creator>schmitz</dc:creator><dc:date>2006-09-13T17:53:03+02:00</dc:date><dc:subject>faloutsos graphtheory model graph smallworld internet powerlaw evolution </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Michalis &lt;a href=&#034;http://www.bibsonomy.org/author/Faloutsos&#034;&gt;Faloutsos&lt;/a&gt;  and Petros &lt;a href=&#034;http://www.bibsonomy.org/author/Faloutsos&#034;&gt;Faloutsos&lt;/a&gt;  and Christos &lt;a href=&#034;http://www.bibsonomy.org/author/Faloutsos&#034;&gt;Faloutsos&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;SIGCOMM, &lt;/em&gt;&lt;em&gt;page251-262. &lt;/em&gt;(&lt;em&gt;1999&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/faloutsos"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphtheory"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/model"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/smallworld"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/internet"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/powerlaw"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/evolution"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/22db65142882eeb46c62ba8e5bd4c045b/schmitz"><title>Modeling the Topology of the Internet---An Assessment</title><link>http://www.bibsonomy.org/bibtex/22db65142882eeb46c62ba8e5bd4c045b/schmitz</link><dc:creator>schmitz</dc:creator><dc:date>2006-09-13T16:02:45+02:00</dc:date><dc:subject>graphgenerator evolution graph </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Pascal &lt;a href=&#034;http://www.bibsonomy.org/author/Habegger&#034;&gt;Habegger&lt;/a&gt;  and Hanspeter &lt;a href=&#034;http://www.bibsonomy.org/author/Bieri&#034;&gt;Bieri&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;iam-02-002. &lt;/em&gt;&lt;em&gt;Institute of Computer Science and Applied Mathematics, University of Bern, Switzerland, &lt;/em&gt;(&lt;em&gt;2002&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphgenerator"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/evolution"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/></rdf:Bag></taxo:topics></item></rdf:RDF>