query: Algorithm to calculate N paths from K set
positive_passages.docid: 8149
positive_passages.text: Algorithm to return all combinations of k elements from n
negative_passages.docid: 24312
negative_passages.text: Choosing optimal K for KNN
negative_passages.docid: 117862
negative_passages.text: Number of partitions of an $n$-element set into $k$ classes
negative_passages.docid: 38612
negative_passages.text: Pathfinding - A* with least turns
negative_passages.docid: 72440
negative_passages.text: Partition a set into $k$ non-empty subsets
negative_passages.docid: 89611
negative_passages.text: Combinations of selecting $n$ objects with $k$ different types
negative_passages.docid: 43845
negative_passages.text: Partitioning the edges of $K_n$ into $\lfloor \frac n6 \rfloor$ planar subgraphs
negative_passages.docid: 113015
negative_passages.text: Eulerian Paths in a Complete Graph $K_5$
negative_passages.docid: 97314
negative_passages.text: Counting nearly-sorted permutations
negative_passages.docid: 110856
negative_passages.text: Number of ways to select $K$ people from $N$ people such that at least $r$ people are there in between them
negative_passages.docid: 33822
negative_passages.text: Is there a monoid structure on the set of paths of a graph?
negative_passages.docid: 48184
negative_passages.text: Prove a graph Containing $2k$ odd vertices contains $k$ distinct trails
negative_passages.docid: 143573
negative_passages.text: Problem (1.8) A Path to Combinatorics Solution Verification.
negative_passages.docid: 85104
negative_passages.text: Counting train stops using combinatorics
negative_passages.docid: 92554
negative_passages.text: How many lattice paths are there from $(0,0)$ to $(2n,2n)$ that avoids odd points
negative_passages.docid: 37503
negative_passages.text: chess path combination
negative_passages.docid: 68882
negative_passages.text: Path to Combinatorics Problem [$1.11$]