I have a graph with nodes representing persons and edges representing their associations. I wish to find all maximally connected sub-graphs (maximal cliques) - which represent the maximal group of persons such that each person in the group knows everyone else and if we add any more nodes the property will not hold (as in definition of maximal clique). As there can be many maximal cliques in a given graph (represented in Neo4j), I want to enumerate all of them.
Please help. Let me know if any more clarification is needed. Thanks. On Thursday, 12 March 2015 14:41:20 UTC+5:30, Mahesh Lal wrote: > > Hi Mohana, > > Your question is vague, hence no one is able to respond. > > Please help us understand your use case by giving examples and telling us > what you hope to achieve. > > Cheers. > > > -- Thanks and Regards > Mahesh Lal > > > On 12 March 2015 at 14:24, Mohana Krishna, IIT Bombay, India < > moha...@gmail.com <javascript:>> wrote: > >> Someone please respond. Thanks. >> >> -- >> 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+un...@googlegroups.com <javascript:>. >> For more options, visit https://groups.google.com/d/optout. >> > > -- 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.
