Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Efficient Algorithms for Listing Combinatorial Structures

Efficient Algorithms for Listing Combinatorial Structures

Goldberg, Leslie Ann
Leslie Ann, Goldberg

Paperback

Series: Distinguished Dissertations in Computer Science, Book 5

General ComputersGeneral Mathematics

ISBN10: 0521117887
ISBN13: 9780521117883
Publisher: Cambridge University Press
Published: Jul 30 2009
Pages: 180
Weight: 0.65
Height: 0.38 Width: 6.69 Depth: 9.61
Language: English
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.

1 different editions

Also available

Also in

General Mathematics

View All