ENGLISH

Efficient algorithms for listing combinatorial structures

By Leslie Ann Goldberg

Book information

Publisher
CUP
Year
1993
ISBN
9780521450218, 0521450217
LCC
QA76.9.A43 G65 1993
Open Library ID
OL1135814M
Language
english
Format
DJVU
Filesize
1 MB (1124401 bytes)
Series
Distinguished Dissertations in Computer Science
Pages
177\177
Library
Kolxo3
DPI
300
Time added
2010-11-11 16:01:50

Description

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 that are of interest to theoretical computer scientists and combinatorialists? Among those families considered are unlabeled graphs, first-order one properties, Hamiltonian graphs, graphs with cliques of specified order, and k-colorable graphs. Some related work is also included that 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.

Similar books