Efficient Graph Algorithms in Neo4j

We recently released the Neo4j graph algorithms library.

You can use these graph algorithms on your connected data to gain new insights more easily within Neo4j. You can use these graph analytics to improve results from your graph data, for example by focusing on particular communities or favoring popular entities.

We developed this library as part of our effort to make it easier to use Neo4j for a wider variety of applications. Many users expressed interest in running graph algorithms directly on Neo4j without having to employ a secondary system.

We also tuned these algorithms to be as efficient as possible in regards to resource utilization as well as streamlined for later management and debugging.

In this session we'll look at some of these graph algorithms and the types of problems that you can use them for in your applications.

We'll be taking questions live during the session but if you have any before hand be sure to post them in the #neo4j-online-meetup channel of the Neo4j users slack (http://www.neo4j.com/slack).

We'll be hosting this session on YouTube live.

https://www.youtube.com/watch?v=55uB_t0RKTE

Time
09:00 PST (UTC - 8 hours)
12:00 EST (UTC - 5 hours)
16:00 UTC
17:00 BST (UTC + 1 hour)
18:00 CEST (UTC + 2 hour)