Efficient Algorithms for Listing Combinatorial Structures
(Part of the Distinguished Dissertations in Computer Science Series)
No Customer Reviews
Select Format
Select Condition 
Book Overview
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.
Format:Paperback
Language:English
ISBN:0521117887
ISBN13:9780521117883
Release Date:July 2009
Publisher:Cambridge University Press
Length:180 Pages
Weight:0.65 lbs.
Dimensions:0.4" x 6.7" x 9.6"
Customer Reviews
0 rating
Copyright © 2025 Thriftbooks.com
Terms of Use | Privacy Policy | Do Not Sell/Share My Personal Information | Cookie Policy | Cookie Preferences | Accessibility Statement
ThriftBooks ® and the ThriftBooks ® logo are registered trademarks of Thrift Books Global, LLC
ThriftBooks ® and the ThriftBooks ® logo are registered trademarks of Thrift Books Global, LLC
