Efficient algorithms for listing combinatorial structures
著者
書誌事項
Efficient algorithms for listing combinatorial structures
（Distinguished dissertations in computer science）
Cambridge University Press, 1993
- : pbk
大学図書館所蔵 件 / 全25件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Originally presented as Ph.D. thesis
"First published 1993. This digitally printed version 2009" -- Pbk's t.p verso
Bibliography: p. 155-160
内容説明・目次
内容説明
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.
目次
- 1. Introduction
- 2. Techniques for listing combinatorial structures
- 3. Applications to particular families of structures
- 4. Directions for future work on listing
- 5. Related results
- 6. Bibliography.
「Nielsen BookData」 より
