Kaikki kirjat 25 % alennuksella koodilla: BOOKS

  • check Yli 10 miljoonaa kirjaa
  • check Uutuuksia joka päivä
  • check Yli 1 miljoona asiakasta luottaa meihin
  • check Hyvät hinnat ja alennukset
  • check Toimitus koko Eurooppaan

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

englanti
2009-04-14
79,10 € 105,47 €

-25% koodilla BOOKS

Toimittajalla varastossa

Toimitus 15-21 arkipäivässä

30 päivän palautusoikeus

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 ... Täydellinen kuvaus

Saatat myös pitää

Kuvaus

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.

Lisätietoja

Kirjoittaja Goldberg Leslie Ann, Leslie Ann Goldberg
Julkaisija Cambridge University Press
Julkaisuvuosi 2009
Kannen tyyppi Pehmeäkantinen
EAN 9780521117883
Kirjoita oma arvostelusi
Arvostelet: Efficient Algorithms for Listing Combinatorial Structures
Arvostelusi:

Goodreads-arvostelut

79,10 € 105,47 €