Contact
Comment faire ses achats
Livraison
Guide d'achat
Efficient Algorithms for Listing Combinatorial Structures
Anglais
131 b
Jusqu'à 30 jours pour les retours
Les clients ont également acheté
/
Livre de poche
29.41
€
/
binding.
32.04
€
/
Livre de poche
16.17
€
/
Livre de poche
44.47
€
/
Livre de poche
16.17
€
/
Livre de poche
21.32
€
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 Pólya's cycle polynomial is demonstrated.
À propos du livre
Anglais
Offrez ce livre dès aujourd'hui
C’est simple
1 Ajouter au panier et choisir l'option Livrer comme cadeau à la caisse. 2 Nous vous enverrons un bon d'achat 3 Le livre arrivera à l'adresse du destinataireCeci pourrait également vous intéresser
/
Livre relié
98.35
€
/
Livre de poche
10.30
€
/
Livre de poche
23.85
€
Bonjour ! Je suis Libroamiko, votre conseiller littéraire.
Comment puis-je vous aider ?