![](https://dist.neo4j.com/wp-content/uploads/20211005104116/KCut-2.jpg)
Approximate Maximum K-Cut with Neo4j Graph Data Science
Oct 01, 2021 6 mins read
Check out the newest algorithm in the GDS Library, Approximate Maximum K-cut, to cluster related products and separate conflicting entities. Read more →
The GraphRAG Manifesto: Unlock Better GenAI Results With Knowledge Graphs | Read Now
Check out the newest algorithm in the GDS Library, Approximate Maximum K-cut, to cluster related products and separate conflicting entities. Read more →