GraphTour Warmup: Efficient Graph Algorithms, with Michael Hunger


On the evening before the GraphTour hits Amsterdam, we would like to host a meetup that is a bit more technical. Title: Efficient Graph Algorithms In this talk, we will review the Neo4j graph algorithms library.

In this session, we'll look at the Neo4j graph algorithms library, discuss the types of problems you can use them for, and how to gain insights more easily on your connected data.
You can use these graph analytics to improve results from your graph data, for example by focusing on particular communities or favoring popular entities.

The library was developed 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.

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

Michael Hunger is the Head of Developer Relations at Neo4j.
As caretaker of the Neo4j community and ecosystem he especially loves to work with graph-related projects, users and contributors. As a developer, Michael enjoys many aspects of programming languages, learning new things every day, participating in exciting and ambitious open source projects and contributing and writing software related books and articles.programming languages, and improving code.
He is a happy dad of 3 girls and a GraphAddict.

18:00: Doors open
18:15: Dinner
19:00: Efficient Graph Algorithms
20:00: Drinks and Networking
21:30: Leave the building