Skip to main content

Combinatorial Problems

  • Chapter
The Algorithm Design Manual

Abstract

We now consider several algorithmic problems of a purely combinatorial nature. These include sorting and permutation generations, both of which were among the first non-numerical problems arising on electronic computers. Sorting can be viewed as identifying or imposing a total order on the keys, while searching and selection involve identifying specific keys based on their position in this total order.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. D. Knuth. The Art of Computer Programming, Volume 4 Fascicle 2: Generating All Tuples and Permutations. Addison Wesley, 2005.

    Google Scholar 

  2. D. Knuth. The Art of Computer Programming, Volume 4 Fascicle 3: Generating All Combinations and Partitions. Addison Wesley, 2005.

    Google Scholar 

  3. D. Knuth. The Art of Computer Programming, Volume 4 Fascicle 4: Generating All Trees; History of Combinationatorial Generation. Addison Wesley, 2006.

    Google Scholar 

  4. D. Kreher and D. Stinson. Combinatorial Algorithms: Generation, Enumeration, and Search. CRC Press, 1999.

    Google Scholar 

  5. A. Nijenhuis and H. Wilf. Combinatorial Algorithms for Computers and Calculators. Academic Press, Orlando FL, second edition, 1978.

    MATH  Google Scholar 

  6. S. Pemmaraju and S. Skiena. Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Cambridge University Press, New York, 2003.

    MATH  Google Scholar 

  7. F. Ruskey. Combinatorial Generation. Manuscript in preparation. Draft available at http://www.1stworks.com/ref/RuskeyCombGen.pdf, 2003.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Steven S. Skiena .

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag London Limited

About this chapter

Cite this chapter

Skiena, S.S. (2012). Combinatorial Problems. In: The Algorithm Design Manual. Springer, London. https://doi.org/10.1007/978-1-84800-070-4_14

Download citation

  • DOI: https://doi.org/10.1007/978-1-84800-070-4_14

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84800-069-8

  • Online ISBN: 978-1-84800-070-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics