Name
Title | ||
|---|---|---|
Design and Analysis of a Tree-Backtracking Algorithm for Multiset and Pure Permutations. |
Abstract | ||
|---|---|---|
A tree-backtracking-based technique, permutation tree generation with Anterior-items-in-an-array for Remaining Distinct Elements (ARDE), is introduced for multiset and pure permutations. We analyze the algorithm at the assembly level and obtain its time formula for pure permutations. We mathematically prove that our time formula is 11.5% faster than the corresponding formula of the previous fastest algorithm for pure permutations for any length N > 3. We also offer related source codes and executable files on our web site for others to use. © 2012 Springer-Verlag. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-35926-2_31 | IWOCA |
Keywords | Field | DocType |
multiset permutation,tree generation,tree-backtracking | Discrete mathematics,Multiset,Source code,Computer science,Permutation,Algorithm,Tree generation,Backtracking,Web site,Executable | Conference |
Volume | Issue | ISSN |
7643 LNCS | null | 16113349 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ray Jinzhu Chen | 1 | 17 | 1.74 |
| Kevin Scott Reschke | 2 | 2 | 1.43 |
| Hailong Hu | 3 | 1 | 1.03 |