query: Neo4j with algorithms
positive_passages.docid: 143431
positive_passages.text: Experiences of using Neo4j with large datasets?
negative_passages.docid: 138226
negative_passages.text: Finding All n-regular graphs on m vertices
negative_passages.docid: 49193
negative_passages.text: Constructing a graph from a degree sequence
negative_passages.docid: 140044
negative_passages.text: A set union find algorithm
negative_passages.docid: 130997
negative_passages.text: Path finding algorithms?
negative_passages.docid: 128027
negative_passages.text: Converting hierarchies of rules to associations
negative_passages.docid: 34517
negative_passages.text: Algorithm for best Reputation League
negative_passages.docid: 54749
negative_passages.text: How to find the number of perfect matchings in complete graphs?
negative_passages.docid: 100832
negative_passages.text: Number of binary trees with $N$ nodes
negative_passages.docid: 151152
negative_passages.text: Removing nodes from graphs such that one is dependent on other - ZIO $2010$, P$1$
negative_passages.docid: 19219
negative_passages.text: On the invertibility of the adjacency matrix of a graph
negative_passages.docid: 71978
negative_passages.text: Tower of Hanoi: Recursive Algorithm
negative_passages.docid: 154500
negative_passages.text: Typing Complete Graphs with edge and vertex label
negative_passages.docid: 84585
negative_passages.text: Linked lists and patterns python
negative_passages.docid: 27977
negative_passages.text: Displaying a bipartite graph in Wolfram Mathematica
negative_passages.docid: 83872
negative_passages.text: Isomorphisms for graphs with loops and multiple edges
negative_passages.docid: 19413
negative_passages.text: Degree sequence multigraph without loop