Efficient Algorithms for Listing Combinatorial Structures (Hardcover)

First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. The research described here gives some answers to the following questions: which families of combinatorial structures have fast computer algorithms for listing their members? What general methods are useful for listing combinatorial structures? How can these be applied to those families which are of interest to theoretical computer scientists and combinatorialists? Amongst those families considered are unlabelled graphs, first order one properties, Hamiltonian graphs, graphs with cliques of specified order, and k-colourable graphs. Some related work is also included, which compares the listing problem with the difficulty of solving the existence problem, the construction problem, the random sampling problem, and the counting problem. In particular, the difficulty of evaluating Polya's cycle polynomial is demonstrated.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Series:	Distinguished Dissertations in Computer Science
Release date:	April 1993
First published:	1993
Authors:	Leslie Ann Goldberg
Dimensions:	244 x 170 x 11mm (L x W x T)
Format:	Hardcover
Pages:	178
ISBN-13:	978-0-521-45021-8
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Computing & IT > Computer programming > General Promotions
LSN:	0-521-45021-7
Barcode:	9780521450218

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!