Re: [Neo4j] Applying Bron-Kerbosch to a Neo4J database to find cliques?

[Mattias Persson]

I'd say create an implementation in Java which runs embedded in the same JVM as the database and expose a rest endpoint (extension/plugin) for querying it would be the most efficient way to go about it.

2012/7/5 scottandrus <scotta...@gmail.com>

Hi all,

I am attempting to apply a Bron-Kerbosch algorithm (http://en.wikipedia.org/wiki/Bron%E2%80%93Kerbosch_algorithm) to a Neo4j database that I have created via the Neo4JClient package in C#/.NET. My goal is to find cliques (complete subgraphs) of maximal size within the graph.

Is there a good way to attack this problem? My plan at the moment is to create a new linked list structure, pull down the data from the Neo4j database into that, then use the algorithm to iterate through that data structure.

I would appreciate any help, and let me know if I can provide additional information towards the problem!

Scott

--
Mattias Persson, [mat...@neotechnology.com]
Hacker, Neo Technology
www.neotechnology.com