Efficient Algorithms for Listing Combinatorial Structures

By: Leslie Ann Goldberg

Write A Review

Hardcover | 21 June 1993

At a Glance

Hardcover
178 Pages

Dimensions(cm)
24.41 x 16.99 x 1.12

Hardcover

RRP $219.95

$192.99

12%OFF

or 4 interest-free payments of $48.25 with

Ships in 5 to 7 business days

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 P³lya's cycle polynomial is demonstrated.

Industry Reviews

"...selected as one of the three best theses in computer science in the UK in 1992...makes an important contribution to the complexity theory of listing and counting combinatorial structures...gives new and interesting results..." Mathematical Reviews "By any standard, this is an exceptional dissertation. It is well written, with the author always explaining the thrust of the argument, never allowing the technical nature of many of the results to obscure the overall picture. The author has built up a substantial theory..." G.F. Royle, Computing Reviews "...an impressive and thorough examination of listing problems in this framework...the complicated probabilistic arguments needed for the analysis are handled well...this is an exceptional dissertation...well-written, with the author always carefully explaining the thrust of the argument, never allowing the technical nature of many of the results to obscure the overall picture." G.F. Royle, Mathematics of Computing

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Computing & I.T.Computer Science Mathematics Combinatorics & Graph Theory Computer Programming & Software Development Algorithms & Data Structures

Introduction
Techniques for listing combinatorial structures
Applications to particular families of structures
Directions for future work on listing
Related results
Bibliography
Table of Contents provided by Publisher. All Rights Reserved.

Efficient Algorithms for Listing Combinatorial Structures

At a Glance

Hardcover

Industry Reviews

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Mathematics

The Infinite Game

From the bestselling author of Start With Why

Tomoko Fuse's Amazing Kusudama Origami

Geometric Paper Art from Japan's Leading Expert!

The Delicate Art of Brute Force

How to Compute It When You Can't Solve It

The Art of Gathering

How We Meet and Why It Matters

Humble Pi

A Comedy of Maths Errors

The Selfish Gene

40th Anniversary edition

The Times Fiendish Su Doku Book 19

200 challenging Su Doku puzzles

Maths Sequences for the Early Years F-2

Challenging Children to Reason Mathematically

Antifragile

Things That Gain from Disorder

Microsoft Power BI For Dummies

For Dummies (Computer/Tech)

Statistics and Data Handling for Biologists

A Student's Guide

Statistics and Data Handling for Biologists

A Student's Guide

Introduction to Artificial Intelligence in Automotive Engineering

Understanding Theory and Practical Applications

Introduction to Artificial Intelligence in Automotive Engineering

Understanding Theory and Practical Applications

Social Groups and Identities

Developing the Legacy of Henri Tajfel

Assertion and Its Social Context

Psychology Revivals

Stochastic Control in Energy, Environmental and Resource Management Applications

Emerging Methodologies and Applications in Modelling, Identification and Control

Recent Advances in Information Systems

Proceedings of the ICRAIS, Pointe aux Piments, Mauritius, 10-12 September 2025

Spectra of Signed Graphs

London Mathematical Society Lecture Note Series

Small Probabilities and High Stakes

Elements in Decision Theory and Philosophy

Small Probabilities and High Stakes

Elements in Decision Theory and Philosophy

General Topology for Beginners

Modal Semirings and Applications

Trends in Logic

Methusalem Seminars at Ghent Analysis and PDE Center

Extended Abstracts 2023/2024

This product is categorised by