1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DS2015
A family of greedy algorithms for finding maximum independent sets
Asbjørn Brændeland
The greedy algorithm A iterates over a set of uniformly sized independent sets of a given graph G and checks for each set S which non-neighbor of S, if any, is best suited to be ad…
cs.DS2015
Rule based lexicographical permutation sequences
Asbjørn Brændeland
In a permutation sequence built by means of sub permutations the transition between successive permutations are subject to a set of n(n - 1)/2 rules that group into n - 1 matrices…
cs.DS2015★ 1 cited
nCk sequences and their difference sequences
Asbjørn Brændeland
A nCk sequence is a sequence of n-bit numbers with k bits set. Given such a sequence C, the difference sequence D of C is subject to certain regularities that make it possible to g…