Efficient algorithms to rank and unrank permutations in lexicographic order

International Symposium on Combinatorial Search, SoCS 2008

Volumn , Issue , 2008, Pages

  Bonet, Blai ^a  

^a UNIVERSIDAD SIMÓN BOLÍVAR   (Venezuela)

Author keywords

[No Author keywords available]

Indexed keywords

LEXICOGRAPHIC ORDER; LINEAR-TIME; LINEAR-TIME ALGORITHMS; NON-UNIFORM; RANKING ALGORITHM; UNIFORM ALGORITHMS;

ALGORITHMS;

EID: 84893220467     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. Cormen, T.; Leiserson, C.; and Rivest, R. 1990. Introduction to Algorithms. MIT Press.
2. Critani, F.; Dall'Aglio,M.; and Biase, G.D. 1997. Ranking and unranking permutations with applications. Innovation in Mathematics 15(3):99-106.
3. Culberson, J., and Schaeffer, J. 1998. Pattern databases. Computational Intelligence 14(3):318-334.
4. ietz, P.F. 1989. Optimal algorithms for list indexing and subset ranking. In Proc. of Workshop on Algorithms and Data Structures, 39-46. Springer LNCS 382.
5. Felner, A.; Korf, R.E.; and Hanan, S. 2004. Additive pattern database heuristics. Journal of Artificial Intelligence Research 22:279-318.
6. Knuth, D.E. 1973. The Art of Computer Programming, Vol. III: Sorting and Searching. Addison-Wesley.
7. Korf, R., and Felner, A. 2002. Disjoint pattern database heuristics. Artificial Intelligence 134:9-22.
8. Korf, R., and Schultze, P. 2005. Large-scale, parallel breadth-first search. In Veloso, M., and Kambhampati, S., eds., Proc. 20th National Conf. on Artificial Intelligence, 1380-1385. Pittsburgh, PA: AAAI Press / MIT Press.
9. Myrvold,W.J., and Ruskey, F. 2001. Ranking and unranking permutations in linear time. Information Processing Letters 79(6):281-284.
10. Ruskey, F.; Jiang, M.; and Weston, A. 1995. The Hamiltonicity of directed σ-τ Cayley graphs (or: A tale of backtracking). Discrete Appl. Math. 57(1):75-83.