Efficient Algorithms for Listing Combinatorial Structures Image close
Efficient Algorithms for Listing Combinatorial Structures by Leslie Ann Goldberg
Efficient Algorithms for Listing Combinatorial Structures by Leslie Ann Goldberg
Show Hide Adult Content
Efficient Algorithms for Listing Combinatorial Structures close

Non-Fiction Books:

Home  
Books  
Non-Fiction  
Maths & Science  
Mathematics  
Combinatorics & graph theory

Efficient Algorithms for Listing Combinatorial Structures

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

By:

Format:

Paperback / softback
$116.00
Available from supplier

The item is brand new and in-stock with one of our preferred suppliers. The item will ship from a Mighty Ape warehouse within the timeframe shown.

Usually ships in 3-4 weeks
0 in Trolley
Free Delivery with Primate
Join Now

Free 14 day free trial, cancel anytime.

Buy Now, Pay Later with:

4 payments of $29.00 with Afterpay Learn more

6 weekly interest-free payments of $19.33 with Laybuy Learn more

Availability

Delivering to:

Estimated arrival:

  • Around 6-18 June using International Courier

Explore more Distinguished Dissertations in Computer Science

See all products in this series

Efficient Algorithms for Listing Combinatorial Structures on Hardback by Leslie Ann Goldberg
$281.00
Efficient Algorithms for Listing Combinatorial Structures
by Leslie Ann Goldberg ~ Hardback
Available - Usually ships in 3-4 weeks
Qualified Types by Mark P. Jones
$116.00
Qualified Types
by Mark P. Jones ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Specification and Proof in Real Time CSP by Jim Davies
$165.00
Specification and Proof in Real Time CSP
by Jim Davies ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Three-Dimensional Integrated Circuit Layout on Hardback by A.C. Harter
$322.00
Three-Dimensional Integrated Circuit Layout
by A.C. Harter ~ Hardback
Available - Usually ships in 3-4 weeks
Specification and Proof in Real Time CSP on Hardback by Jim Davies
$302.00
Specification and Proof in Real Time CSP
by Jim Davies ~ Hardback
Available - Usually ships in 3-4 weeks
Axiomatic Domain Theory in Categories of Partial Maps by Marcelo P. Fiore
$131.00
Axiomatic Domain Theory in Categories of Partial Maps
by Marcelo P. Fiore ~ Paperback / softback
Available - Usually ships in 3-4 weeks
A Compositional Approach to Performance Modelling by Jane Hillston
$129.00
A Compositional Approach to Performance Modelling
by Jane Hillston ~ Paperback / softback
Available - Usually ships in 3-4 weeks
A Modular and Extensible Network Storage Architecture on Hardback by Sai Lai Lo
$279.00
A Modular and Extensible Network Storage Architecture
by Sai Lai Lo ~ Hardback
Available - Usually ships in 3-4 weeks
Functional Programming and Input/Output by Andrew D. Gordon
$103.00
Functional Programming and Input/Output
by Andrew D. Gordon ~ Paperback / softback
Available - Usually ships in 3-4 weeks
The Map-Building and Exploration Strategies of a Simple Sonar-Equipped Mobile Robot by D.C. Lee
$112.00
The Map-Building and Exploration Strategies of a Simple...
by D.C. Lee ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Three-Dimensional Integrated Circuit Layout by A.C. Harter
$129.00
Three-Dimensional Integrated Circuit Layout
by A.C. Harter ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Logic Programming by James H. Andrews
$111.00
Logic Programming
by James H. Andrews ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Affine Analysis of Image Sequences by Larry S. Shapiro
$111.00
Affine Analysis of Image Sequences
by Larry S. Shapiro ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Modelling Auditory Processing and Organisation by Martin Cooke
$111.00
Modelling Auditory Processing and Organisation
by Martin Cooke ~ Paperback / softback
Available - Usually ships in 3-4 weeks
A Modular and Extensible Network Storage Architecture by Sai Lai Lo
$93.00
A Modular and Extensible Network Storage Architecture
by Sai Lai Lo ~ Paperback / softback
Available - Usually ships in 3-4 weeks

Description

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.
Release date NZ
July 30th, 2009
Audience
  • Professional & Vocational
Illustrations
Worked examples or Exercises
Pages
180
Dimensions
170x244x10
ISBN-13
9780521117883
Product ID
3169472

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Recommended for you

Recommended from your browsing history

Help & options

Filed under...

Books >
Non-Fiction >
Maths & Science >
Mathematics >
Combinatorics & graph theory
Books >
Computers & Internet >
Computer Programming >
Algorithms & procedures
Books >
Computers & Internet >
Computer programming / software development >
Algorithms & data structures