Prepare for ranking chapter.

diff --git a/Makefile b/Makefile
index 10c98f03b41f7e67f7e3948762c03cdbf707844f..e3dfed248e3190eab42e889c954d6962881c168b 100644 (file)
--- a/Makefile
+++ b/Makefile
@@ -1,6 +1,6 @@
 all: saga.ps
 
-CHAPTERS=cover mst notation ram adv
+CHAPTERS=cover mst notation ram adv rank
 
 %.dvi: %.tex macros.tex biblio.bib
        tex $< && if grep -q citation $*.aux ; then bibtex $* && tex $< && tex $< ; fi

diff --git a/biblio.bib b/biblio.bib
index 93cbf67e0cf33deb784e89ea2051fb072814da8b..ba96577b7d15c5e3a3f93e258c0f73b469e416a3 100644 (file)
--- a/biblio.bib
+++ b/biblio.bib
@@ -513,6 +513,15 @@ inproceedings{ pettie:minirand,
  address = {Redwood City, CA, USA},
 }
 
+@book{ knuth:sas,
+  author = {Donald E. Knuth},
+  title = {{The Art of Computer Programming, Volume 3 (2nd ed.): Sorting and Searching}},
+  year = {1998},
+  isbn = {978-0-201-89685-5},
+  publisher = {Addison Wesley Longman Publishing Co., Inc.},
+  address = {Redwood City, CA, USA},
+}
+
 @inproceedings{ hagerup:wordram,
  author = {Torben Hagerup},
  title = {{Sorting and Searching on the Word RAM}},
@@ -660,3 +669,75 @@ inproceedings{ pettie:minirand,
     year = "1998",
     url = "citeseer.ist.psu.edu/223918.html"
 }
+
+@article{ myrvold:rank,
+  title={{Ranking and unranking permutations in linear time}},
+  author={Myrvold, W.J. and Ruskey, F.},
+  journal={Information Processing Letters},
+  volume={79},
+  number={6},
+  pages={281--284},
+  year={2001}
+}
+
+@inproceedings{ critani:rau,
+  title={{Ranking and unranking permutations with applications}},
+  author={Critani, F. and Dall'Aglio, M. and Di Biase, G.},
+  booktitle={Innovation in Mathematics: Proceedings of Second International Mathematica Symposium},
+  pages = "99-106",
+  year = "1997"
+}
+
+@article{ ruskey:ham,
+  title={{The Hamiltonicity of directed-Cayley graphs (or: A tale of backtracking)}},
+  author={Ruskey, F. and Jiang, M. and Weston, A.},
+  journal={Discrete Appl. Math},
+  volume={57},
+  pages={75--83},
+  year={1995}
+}
+
+@article{ ruskey:hce,
+  title={{Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of Sn}},
+  author={Ruskey, F. and Savage, C.D.},
+  journal={SIAM Journal on Discrete Mathematics},
+  volume={6},
+  number={1},
+  pages={152--166},
+  year={1993}
+}
+
+@article{ liehe:raulow,
+  title={{Ranking and Unranking of Lexicographically Ordered Words: An Average-Case Analysis}},
+  author={Liebehenschel, J.},
+  journal={Journal of Automata, Languages and Combinatorics},
+  volume={2},
+  number={4},
+  pages={227--268},
+  year={1997}
+}
+
+@book{ reingold:catp,
+  title={{Combinatorial Algorithms: Theory and Practice}},
+  author={Reingold, E.M.},
+  year={1977},
+  publisher={Prentice Hall College Div}
+}
+
+@inproceedings{ dietz:oal,
+ author = {Paul F. Dietz},
+ title = {Optimal Algorithms for List Indexing and Subset Rank},
+ booktitle = {WADS '89: Proceedings of the Workshop on Algorithms and Data Structures},
+ year = {1989},
+ isbn = {3-540-51542-9},
+ pages = {39--46},
+ publisher = {Springer-Verlag},
+ address = {London, UK},
+}
+
+@book { ss:fifteen,
+  title={{The 15 Puzzle Book}},
+  author={Slocum, J. and Sonneveld D.},
+  year={2006},
+  publisher={The Slocum Puzzle Foundation, Beverly Hills, CA, USA}
+}

diff --git a/rank.tex b/rank.tex
new file mode 100644 (file)
index 0000000..a0823ea
--- /dev/null
+++ b/rank.tex
@@ -0,0 +1,10 @@
+\ifx\endpart\undefined
+\input macros.tex
+\fi
+
+\chapter{Ranking Combinatorial Structures}
+
+\section{Ranking of permutations}
+
+
+\endpart

diff --git a/saga.tex b/saga.tex
index 1661e9c7dd038c394273f7214295a8ba5b3e45b9..58483eb17a6bf2646e44af5855bc1a79b9a3e6ad 100644 (file)
--- a/saga.tex
+++ b/saga.tex
@@ -5,6 +5,7 @@
 \input mst.tex
 \input ram.tex
 \input adv.tex
+\input rank.tex
 
 \input notation.tex