Re: [Neo] Find Dominating Set in a graph,Dead end using Neo4j

2010-04-09 Thread Tobias Ivarsson
Hi, Sorry for the much delayed response. First a disclaimer: Neo4j makes no claim to magically make P=NP (the problem of finding a minimal dominating set is NP-hard), it would be cool if Neo4j could be used to prove such a thing, but I am not going to spend the rest of my life attempting it. I

Re: [Neo] Find Dominating Set in a graph,Dead end using Neo4j

2010-03-29 Thread Peter Neubauer
Hi Francis, have no direct clue on how to solve the algo without holding the nodes in memory in order to track progress. Not a nice one. Any algo expert around here to have a better solution? Cheers, /peter neubauer COO and Sales, Neo Technology GTalk: neubauer.peter Skype

[Neo] Find Dominating Set in a graph,Dead end using Neo4j

2010-03-28 Thread francis adediran
Hi, I have been trying to solve the problem of minimal dominating set using Neo4j but to no avail. The algorithm to solve this problem is correct but implementing it using Neo4j is becoming a pain or maybe i'm not yet familiar with Neo as i thought i was. The minimal dominating set in a graph is