https://www.bibsonomy.org/user/mstrohm/graphsBibSonomy RSS Feed for /user/mstrohm/graphshttp://courses.csail.mit.edu/6.042/spring12/mcsfull.pdfmstrohm2012-03-22T20:46:05+01:00books course graphs mathematics <a itemprop="url" data-versiondate="2012-03-22T20:46:05+01:00" href="http://courses.csail.mit.edu/6.042/spring12/mcsfull.pdf" rel="nofollow" class="description-link">http://courses.csail.mit.edu/6.042/spring12/mcsfull.pdf</a>Amin Saberi Associate Professor Management Science and Engineering, Stanford University http://www.stanford.edu/~saberi/mstrohm2012-02-01T21:52:49+01:00graphs networks people <span itemprop="description">Amin Saberi Associate Professor Management Science and Engineering, Stanford University </span>MatlabBGL is a Matlab package for working with graphs. It uses the Boost Graph Library to efficiently implement the graph algorithms. MatlabBGL is designed to work with large sparse graphs with hundreds of thousands of nodes.http://www.cs.purdue.edu/homes/dgleich/packages/matlab_bgl/mstrohm2012-02-01T21:50:40+01:00graphs mathematics mining networks simulation tools <span itemprop="description">MatlabBGL is a Matlab package for working with graphs. It uses the Boost Graph Library to efficiently implement the graph algorithms. MatlabBGL is designed to work with large sparse graphs with hundreds of thousands of nodes.</span>http://www.stanford.edu/group/waw/call-for-papers.htmlmstrohm2010-08-16T12:08:48+02:00CfP graphs mining web-science <a itemprop="url" data-versiondate="2010-08-16T12:08:48+02:00" href="http://www.stanford.edu/group/waw/call-for-papers.html" rel="nofollow" class="description-link">http://www.stanford.edu/group/waw/call-for-papers.html</a>Markov chainshttp://jasss.soc.surrey.ac.uk/12/1/6.htmlmstrohm2010-04-23T11:57:03+02:00graphs networks simulation theory tools <span itemprop="description">Markov chains</span>bookhttp://stat-www.berkeley.edu/users/aldous/RWG/book.htmlmstrohm2010-04-21T10:14:18+02:00books graphs networks <span itemprop="description">book</span>http://components.neo4j.org/graph-algo/mstrohm2010-03-12T22:24:20+01:00algorithms graphs networks tools web-science <a itemprop="url" data-versiondate="2010-03-12T22:24:20+01:00" href="http://components.neo4j.org/graph-algo/" rel="nofollow" class="description-link">http://components.neo4j.org/graph-algo/</a>presented @ ICWSMhttp://gephi.org/mstrohm2010-02-08T12:23:33+01:00graphs knowledge-visualization tools <span itemprop="description">presented @ ICWSM</span>MatlabBGL is a Matlab package for working with graphs. It uses the Boost Graph Library to efficiently implement the graph algorithms. MatlabBGL is designed to work with large sparse graphs with hundreds of thousands of nodes.http://www.stanford.edu/~dgleich/programs/matlab_bgl/mstrohm2009-02-23T11:02:37+01:00graphs mathematics networks tools <span itemprop="description">MatlabBGL is a Matlab package for working with graphs. It uses the Boost Graph Library to efficiently implement the graph algorithms. MatlabBGL is designed to work with large sparse graphs with hundreds of thousands of nodes.</span>An expandable framework, operating within MatLab, which provides a convenient environment for import/export, manipulation and analysis of complex networks. Currently, the toolbox contains dozens of efficiently implemented and thoroughly validated algorithms. Most of these algorithms are implemented as C++ mex-files to achieve maximal efficiency. All algorithms are well-documented and typical researcher can start using the toolbox within minutes.http://levmuchnik.net/Content/Networks/ComplexNetworksPackage.htmlmstrohm2009-02-23T11:01:04+01:00graphs mathematics networks tools <span itemprop="description">An expandable framework, operating within MatLab, which provides a convenient environment for import/export, manipulation and analysis of complex networks. Currently, the toolbox contains dozens of efficiently implemented and thoroughly validated algorithms. Most of these algorithms are implemented as C++ mex-files to achieve maximal efficiency. All algorithms are well-documented and typical researcher can start using the toolbox within minutes.</span>license necessaryhttp://www.yworks.com/en/products_yfiles_about.htmlmstrohm2009-02-04T13:07:02+01:00graphs networks tools <span itemprop="description">license necessary</span>http://cytoscape.org/mstrohm2009-01-22T17:40:53+01:00graphs knowledge-visualization networks tools <a itemprop="url" data-versiondate="2009-01-22T17:40:53+01:00" href="http://cytoscape.org/" rel="nofollow" class="description-link">http://cytoscape.org/</a>by C. Faloutsos and H. Tonghttp://www.cs.cmu.edu/~htong/tut/cikm2008/cikm_tutorial.htmlmstrohm2008-10-27T03:12:41+01:00graphs networks slides tutorial <span itemprop="description">by C. Faloutsos and H. Tong</span>http://www-personal.umich.edu/~ladamic/mstrohm2008-07-28T17:39:33+02:00SNA graphs networks people <a itemprop="url" data-versiondate="2008-07-28T17:39:33+02:00" href="http://www-personal.umich.edu/~ladamic/" rel="nofollow" class="description-link">http://www-personal.umich.edu/~ladamic/</a>http://www.upriss.org.uk/fca/fca.htmlmstrohm2008-07-28T17:19:17+02:00SNA graphs mathematics networks tools <a itemprop="url" data-versiondate="2008-07-28T17:19:17+02:00" href="http://www.upriss.org.uk/fca/fca.html" rel="nofollow" class="description-link">http://www.upriss.org.uk/fca/fca.html</a>@ISWC2008: Formal concept analysis (FCA) [1] is a mathematical discipline which formalizes human conceptual thinking in terms of lattice theory. http://www.aifb.uni-karlsruhe.de/WBS/jvo/fca4sw/index.htmlmstrohm2008-07-25T16:35:52+02:00graphs knowledge-acquisition <span itemprop="description">@ISWC2008: Formal concept analysis (FCA) [1] is a mathematical discipline which formalizes human conceptual thinking in terms of lattice theory. </span>Mary McGlohon, School of Computer and Information Science, Carnegie Mellon Universityhttp://videolectures.net/icwsm08_mcglohon_gmtsma/mstrohm2008-06-08T11:15:55+02:00TOWATCH graphs lecture networks <span itemprop="description">Mary McGlohon, School of Computer and Information Science, Carnegie Mellon University</span>http://glinden.blogspot.com/2008/05/random-walks-of-click-graph.htmlmstrohm2008-05-02T15:44:38+02:00SEMINAL SNA graphs search <a itemprop="url" data-versiondate="2008-05-02T15:44:38+02:00" href="http://glinden.blogspot.com/2008/05/random-walks-of-click-graph.html" rel="nofollow" class="description-link">http://glinden.blogspot.com/2008/05/random-walks-of-click-graph.html</a>http://www.cs.yale.edu/homes/spielman/eigs/mstrohm2008-04-25T19:04:45+02:00SNA course graphs mathematics <a itemprop="url" data-versiondate="2008-04-25T19:04:45+02:00" href="http://www.cs.yale.edu/homes/spielman/eigs/" rel="nofollow" class="description-link">http://www.cs.yale.edu/homes/spielman/eigs/</a>a collection of resources on graph visualizationhttp://www.graphviz.org/Theory.phpmstrohm2008-04-25T15:21:17+02:00graphs knowledge-visualization networks <span itemprop="description">a collection of resources on graph visualization</span>