Approximate Maximum K-Cut with Neo4j Graph Data Science

Head's Up! These forums are read-only. All users and content have migrated. Please join us at community.neo4j.com.

Cluster related products and separate conflicting entities with the newest algorithm in the Graph Data Science Library: Approximate Maximum K-cutPhoto by Matt Artz on UnsplashThe 1.7 release of Neo4j’s Graph Data Science Library contains some amazing features, like machine learning pipelines for link prediction, and the ability to query in-memory graphs in the graph catalog with Cypher. Amongst all that goodness is ...