@electronic{academicgraph.blob.core.windows.net, title = {Microsoft Academic Graph}, url = {https://academicgraph.blob.core.windows.net/graph/index.html?eulaaccept=on}, biburl = {https://puma.uni-kassel.de/url/e87433348f8a95093f191b6d916fe82e/hotho}, keywords = {MSAC WSDM challenge citation cup dataset graph}, added-at = {2015-09-15T11:40:16.000+0200}, description = {Microsoft Academic Graph Releases:}, interhash = {e87433348f8a95093f191b6d916fe82e}, intrahash = {e87433348f8a95093f191b6d916fe82e} } @electronic{webdatacommons.org, title = {WDC - Hyperlink Graph}, url = {http://webdatacommons.org/hyperlinkgraph/}, biburl = {https://puma.uni-kassel.de/url/0086d4201eb0d279e10a98a39503e9b2/hotho}, keywords = {dataset graph hyperlink web}, added-at = {2013-11-13T10:36:31.000+0100}, description = {This page provides a large hyperlink graph for public download. The graph has been extracted from the Common Crawl 2012 web corpus and covers 3.5 billion web pages and 128 billion hyperlinks between these pages. To the best of our knowledge, this graph is the largest hyperlink graph that is available to the public outside companies such as Google, Yahoo, and Microsoft. Below we provide instructions on how to download the graph as well as basic statistics about its topology. }, interhash = {0086d4201eb0d279e10a98a39503e9b2}, intrahash = {0086d4201eb0d279e10a98a39503e9b2} } @electronic{www.cs.umd.edu, title = {Graph Visualization}, url = {http://www.cs.umd.edu/hcil/graphvis/}, biburl = {https://puma.uni-kassel.de/url/a3ad2d13c6f73653a30422d3f106802f/hotho}, keywords = {graph tools visualization}, added-at = {2013-03-14T10:44:41.000+0100}, description = {Graph Visualization Summary of HCIL projects }, interhash = {a3ad2d13c6f73653a30422d3f106802f}, intrahash = {a3ad2d13c6f73653a30422d3f106802f} } @electronic{research.microsoft.com, title = {TrueSkill Ranking System - Microsoft Research}, url = {http://research.microsoft.com/en-us/projects/trueskill/default.aspx}, biburl = {https://puma.uni-kassel.de/url/89783cf4ff783da530ca2f8cf04872c8/hotho}, keywords = {bayes elo factor graph microsoft prediction ranking research trueskill}, added-at = {2012-03-19T16:37:19.000+0100}, description = {TrueSkill™ Ranking System TrueSkill™ Ranking System The TrueSkill™ ranking system is a skill based ranking system for Xbox Live developed at Microsoft Research.}, interhash = {89783cf4ff783da530ca2f8cf04872c8}, intrahash = {89783cf4ff783da530ca2f8cf04872c8} } @electronic{igraph.sourceforge.net, title = {R: Generate coordinates for plotting graphs}, url = {http://igraph.sourceforge.net/doc/R/layout.html}, biburl = {https://puma.uni-kassel.de/url/271878e88e4b7fc678afd2f529b99397/stephandoerfel}, keywords = {coord coordinates graph igraph layout r}, added-at = {2011-12-18T17:56:12.000+0100}, description = {}, interhash = {271878e88e4b7fc678afd2f529b99397}, intrahash = {271878e88e4b7fc678afd2f529b99397} } @electronic{wiki.neo4j.org, title = {Neo4j Spatial - Neo4j Wiki}, url = {http://wiki.neo4j.org/content/Neo4j_Spatial}, biburl = {https://puma.uni-kassel.de/url/a6e89b35269dd80d001e831417badc39/hotho}, keywords = {database graph neo4j spatial}, added-at = {2011-09-19T18:42:30.000+0200}, description = {The Neo4j database core has no built in support for spatial data. }, interhash = {a6e89b35269dd80d001e831417badc39}, intrahash = {a6e89b35269dd80d001e831417badc39} } @electronic{gephi.org, title = {Gephi, an open source graph visualization and manipulation software}, url = {http://gephi.org/}, biburl = {https://puma.uni-kassel.de/url/952edee463345cb8b56c5e4bfb076abf/hotho}, keywords = {analysis graph network sna visualization}, added-at = {2011-08-15T09:44:36.000+0200}, description = {Gephi is an open-source software for visualizing and analyzing large networks graphs. Gephi uses a 3D render engine to display graphs in real-time and speed up the exploration. Use Gephi to explore, analyse, spatialise, filter, cluterize, manipulate and export all types of graphs.}, interhash = {952edee463345cb8b56c5e4bfb076abf}, intrahash = {952edee463345cb8b56c5e4bfb076abf} } @electronic{www.cs.cmu.edu, title = {Mining Billion-node Graphs: Patterns and Tools}, url = {http://www.cs.cmu.edu/~christos/TALKS/11-LinkedIn/FOILS/faloutsos_linkedin_2011.pdf}, biburl = {https://puma.uni-kassel.de/url/1f1029ec1bad0fd9e70fd7778326fa87/hotho}, keywords = {graph linkedin mining tools toread}, added-at = {2011-06-22T10:38:14.000+0200}, description = {}, interhash = {1f1029ec1bad0fd9e70fd7778326fa87}, intrahash = {1f1029ec1bad0fd9e70fd7778326fa87} } @electronic{compbio.cs.uic.edu, title = {AMAI: Local Pattern Mining Special Issue cfp}, url = {http://compbio.cs.uic.edu/AMAI-LocalPatterns/}, biburl = {https://puma.uni-kassel.de/url/7b610ba4463ea992c76df73db46a9f5e/stephandoerfel}, keywords = {ai amai community descriptive graph intelligence issue journal local mining pattern special}, added-at = {2011-06-21T10:13:50.000+0200}, description = {}, interhash = {7b610ba4463ea992c76df73db46a9f5e}, intrahash = {7b610ba4463ea992c76df73db46a9f5e} } @electronic{www.heise.de, title = {heise online - GraphDB wird schneller und kleiner}, url = {http://www.heise.de/newsticker/meldung/GraphDB-wird-schneller-und-kleiner-1235547.html}, biburl = {https://puma.uni-kassel.de/url/d4f45d6119c0dce3e2da4e6a348fecca/hotho}, keywords = {datenbank db everyaware graph}, added-at = {2011-05-11T15:15:57.000+0200}, description = {Version 2 der freien Graph-Datenbank GraphDB haben die Entwickler modularisiert, auch haben sie die Verteilung von Graphen auf mehrere Knoten ermöglicht. Hinzugekommen sind außerdem neue Schnittstellen, unter anderem für PHP.}, interhash = {d4f45d6119c0dce3e2da4e6a348fecca}, intrahash = {d4f45d6119c0dce3e2da4e6a348fecca} } @electronic{neo4j.org, title = {neo4j open source nosql graph database »}, url = {http://neo4j.org/}, biburl = {https://puma.uni-kassel.de/url/5b416ddf56e9bbcf88ae49e775d25c87/hotho}, keywords = {database everyaware graph open source}, added-at = {2011-03-14T18:52:38.000+0100}, description = {}, interhash = {5b416ddf56e9bbcf88ae49e775d25c87}, intrahash = {5b416ddf56e9bbcf88ae49e775d25c87} } @electronic{murderandcreate.com, title = {traer physics library}, url = {http://murderandcreate.com/physics/}, biburl = {https://puma.uni-kassel.de/url/da817430e7b606180893e01182e1fc4e/benz}, keywords = {energy graph layout lib library physics software traer}, added-at = {2011-03-10T23:23:06.000+0100}, description = {A simple particle system physics engine for processing. I've designed this to be application / domain agnostic. All this is supposed to do is let you make particles, apply forces and calculate the positions of particles over time in real-time. Anything else you need to handle yourself. }, interhash = {da817430e7b606180893e01182e1fc4e}, intrahash = {da817430e7b606180893e01182e1fc4e} } @electronic{www.music-map.de, title = {Music-Map - Die Landkarte der Musik}, url = {http://www.music-map.de/}, biburl = {https://puma.uni-kassel.de/url/a6354e57172178fc17a28ade82baf2bd/benz}, keywords = {artists graph music network visualization}, added-at = {2011-02-04T16:09:16.000+0100}, description = {}, interhash = {a6354e57172178fc17a28ade82baf2bd}, intrahash = {a6354e57172178fc17a28ade82baf2bd} } @electronic{gvsr.polytech.univ-nantes.fr, title = {Graph Visualization Software References Beta}, url = {http://gvsr.polytech.univ-nantes.fr/GVSR_beta/task?action=browse}, biburl = {https://puma.uni-kassel.de/url/289b56d783f4b445abd80eb2404b7284/benz}, keywords = {graph software visualization}, added-at = {2011-02-04T16:08:35.000+0100}, description = {Graph Visualization Software Explorer}, interhash = {289b56d783f4b445abd80eb2404b7284}, intrahash = {289b56d783f4b445abd80eb2404b7284} } @electronic{jung.sourceforge.net, title = {JUNG - Java Universal Network/Graph Framework}, url = {http://jung.sourceforge.net/}, biburl = {https://puma.uni-kassel.de/url/a04017a2230ec0fdc3072a61ae49de57/benz}, keywords = {graph java jung library}, added-at = {2011-02-04T16:08:22.000+0100}, description = {JUNG — the Java Universal Network/Graph Framework--is a software library that provides a common and extendible language for the modeling, analysis, and visualization of data that can be represented as a graph or network. It is written in Java, which allows JUNG-based applications to make use of the extensive built-in capabilities of the Java API, as well as those of other existing third-party Java libraries. }, interhash = {a04017a2230ec0fdc3072a61ae49de57}, intrahash = {a04017a2230ec0fdc3072a61ae49de57} } @electronic{www.cs.umd.edu, title = {Graph Visualization}, url = {http://www.cs.umd.edu/hcil/graphvis/}, biburl = {https://puma.uni-kassel.de/url/a3ad2d13c6f73653a30422d3f106802f/benz}, keywords = {graph software visualization}, added-at = {2011-02-04T16:08:17.000+0100}, description = {Summary of HCIL projects }, interhash = {a3ad2d13c6f73653a30422d3f106802f}, intrahash = {a3ad2d13c6f73653a30422d3f106802f} } @electronic{www.cs.umd.edu, title = {Graph Visualization bibliography}, url = {http://www.cs.umd.edu/~cdunne/projs/graphbib.html}, biburl = {https://puma.uni-kassel.de/url/bdf013c5338c6d6208f47660dff65026/benz}, keywords = {bibliography graph visualization}, added-at = {2011-02-04T16:08:17.000+0100}, description = {}, interhash = {bdf013c5338c6d6208f47660dff65026}, intrahash = {bdf013c5338c6d6208f47660dff65026} } @electronic{neo4j.org, title = {neo4j open source nosql graph database »}, url = {http://neo4j.org/}, biburl = {https://puma.uni-kassel.de/url/5b416ddf56e9bbcf88ae49e775d25c87/benz}, keywords = {database graph neo4j venus}, added-at = {2011-02-04T16:07:16.000+0100}, description = {}, interhash = {5b416ddf56e9bbcf88ae49e775d25c87}, intrahash = {5b416ddf56e9bbcf88ae49e775d25c87} } @electronic{www.facebook.com, title = {Visualizing Friendships | Facebook}, url = {http://www.facebook.com/note.php?note_id=469716398919}, biburl = {https://puma.uni-kassel.de/url/235eee35f3fbedf084cf605381e4aad7/stephandoerfel}, keywords = {facebook friend friendships graph visualizing}, added-at = {2010-12-15T14:47:58.000+0100}, description = {}, interhash = {235eee35f3fbedf084cf605381e4aad7}, intrahash = {235eee35f3fbedf084cf605381e4aad7} } @electronic{socialmedia.typepad.com, title = {Social Media Research Blog: Social Network Visualization Eyecandy}, url = {http://socialmedia.typepad.com/blog/2008/10/social-network-visualization-eyecandy.html}, biburl = {https://puma.uni-kassel.de/url/0006fe7ff424db6bda53bc2fe27c1ad0/hotho}, keywords = {blog community detection graph media network post social visualization}, added-at = {2009-04-28T15:06:41.000+0200}, description = {Visualization of graph data is incredibly challenging, particularly when it comes to extremely large, scale-free graphs and social networks. A few simple searches on the Web and you will find some mesmerizing and very cool images. Perhaps the most cited...}, interhash = {0006fe7ff424db6bda53bc2fe27c1ad0}, intrahash = {0006fe7ff424db6bda53bc2fe27c1ad0} }