Skip to content
Free planNo credit card requiredStart writing

article · ACM SIGACT News · 1999

Combinatorial algorithms

Donald L. Kreher, Douglas R. Stinson

Cited by 116Open access

Abstract

Our objective in writing this book was to produce a general, introductory textbook on the subject o f combinatorial algorithms . Several textbooks on combinatorial algorithms were written in the 1970s , and are now out-of-date . More recent books on algorithms have either been general textbooks , or books on specialized topics, such as graph algorithms to name one example . We felt that a new textbook on combinatorial algorithms, that emphasizes the basic techniques of generation , enumeration and search, would be very timely.

Cite this paper

APA 7

Kreher, D. L., & Stinson, D. R. (1999). Combinatorial algorithms. ACM SIGACT News, 30(1), 33–35. https://doi.org/10.1145/309739.309744

MLA 9

Kreher, Donald L., and Douglas R. Stinson. “Combinatorial algorithms.” ACM SIGACT News, vol. 30, no. 1, 1999, pp. 33–35, https://doi.org/10.1145/309739.309744.

Chicago

Kreher, Donald L., and Douglas R. Stinson. 1999. “Combinatorial algorithms.” ACM SIGACT News 30 (1): 33–35. https://doi.org/10.1145/309739.309744.

Harvard

Kreher, D.L. and Stinson, D.R. (1999) ‘Combinatorial algorithms’, ACM SIGACT News, 30(1), pp. 33–35. Available at: https://doi.org/10.1145/309739.309744.

BibTeX
@article{kreher1999combinatorial,
  title = {{Combinatorial algorithms}},
  author = {Kreher, Donald L. and Stinson, Douglas R.},
  journal = {ACM SIGACT News},
  volume = {30},
  number = {1},
  pages = {33--35},
  year = {1999},
  doi = {10.1145/309739.309744}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.