Hello, Is there a way to run parallel graph algorithms using map-reduce paradigm on a graph represented in Neo4j. Like if I wish to run a map-reduce version of Bron-Kerbosch algorithm to enumerate all maximal cliques in a graph represented in Neo4j, is there a way?
Please provide some pointers/examples. Thanks in advance. -- You received this message because you are subscribed to the Google Groups "Neo4j" group. To unsubscribe from this group and stop receiving emails from it, send an email to neo4j+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
