Bezmaksas piegāde pasūtījumiem virs 29€

  • check 10+ miljoni grāmatu
  • check Jaunumi katru dienu
  • check Vairāk nekā 1 miljons klientu mums uzticas
  • check Labas cenas un atlaides
  • check Piegāde visā Eiropā

Efficient Algorithms for Listing Combinatorial Structures - Goldberg Leslie Ann,Leslie Ann Goldberg

angļu valoda
2009-04-14
73,83 € 105,47 €

-30% ar kodu BOOKS

Piegādātāja noliktavā

Piegāde 15-21 darba dienu laikā

30 dienu atgriešanas politika

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 interes ... Pilns apraksts

Jums varētu patikt arī

Aprašymas

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.

Vairāk informācijas

Autors Goldberg Leslie Ann, Leslie Ann Goldberg
Izdevējs Cambridge University Press
Izlaides gads 2009
Vāka tips Mīkstais vāks
EAN 9780521117883
Rakstiet savu atsauksmi
Jūs vērtējat: Efficient Algorithms for Listing Combinatorial Structures
Jūsu novērtējums:

Goodreads atsauksmes

73,83 € 105,47 €