Efficient Algorithms for Listing Combinatorial Structures

Research output: Chapter in Book/Conference paperOther chapter contribution

Original languageEnglish
Title of host publicationComputing Reviews
Place of PublicationNew York
PublisherComputing Reviews - ACM (The Association for Computing Machinery)
Pages343- 344
Publication statusPublished - 1995

Cite this

Royle, G. (1995). Efficient Algorithms for Listing Combinatorial Structures. In Computing Reviews (pp. 343- 344). New York: Computing Reviews - ACM (The Association for Computing Machinery).
Royle, Gordon. / Efficient Algorithms for Listing Combinatorial Structures. Computing Reviews. New York : Computing Reviews - ACM (The Association for Computing Machinery), 1995. pp. 343- 344
@inbook{b9dac51bbc0d4ded973ab9782cc0f58f,
title = "Efficient Algorithms for Listing Combinatorial Structures",
author = "Gordon Royle",
year = "1995",
language = "English",
pages = "343-- 344",
booktitle = "Computing Reviews",
publisher = "Computing Reviews - ACM (The Association for Computing Machinery)",

}

Royle, G 1995, Efficient Algorithms for Listing Combinatorial Structures. in Computing Reviews. Computing Reviews - ACM (The Association for Computing Machinery), New York, pp. 343- 344.

Efficient Algorithms for Listing Combinatorial Structures. / Royle, Gordon.

Computing Reviews. New York : Computing Reviews - ACM (The Association for Computing Machinery), 1995. p. 343- 344.

Research output: Chapter in Book/Conference paperOther chapter contribution

TY - CHAP

T1 - Efficient Algorithms for Listing Combinatorial Structures

AU - Royle, Gordon

PY - 1995

Y1 - 1995

M3 - Other chapter contribution

SP - 343

EP - 344

BT - Computing Reviews

PB - Computing Reviews - ACM (The Association for Computing Machinery)

CY - New York

ER -

Royle G. Efficient Algorithms for Listing Combinatorial Structures. In Computing Reviews. New York: Computing Reviews - ACM (The Association for Computing Machinery). 1995. p. 343- 344