Efficient Algorithms for Listing Combinatorial Structures - Goldberg, Leslie Ann
- Format: Relié Voir le descriptif
Vous en avez un à vendre ?
Vendez-le-vôtreSoyez informé(e) par e-mail dès l'arrivée de cet article
Créer une alerte prix
- Payez directement sur Rakuten (CB, PayPal, 4xCB...)
- Récupérez le produit directement chez le vendeur
- Rakuten vous rembourse en cas de problème
Gratuit et sans engagement
Félicitations !
Nous sommes heureux de vous compter parmi nos membres du Club Rakuten !
TROUVER UN MAGASIN
Retour
Avis sur Efficient Algorithms For Listing Combinatorial Structures Format Relié - Livre
0 avis sur Efficient Algorithms For Listing Combinatorial Structures Format Relié - Livre
Donnez votre avis et cumulez 5
Les avis publiés font l'objet d'un contrôle automatisé de Rakuten.
Présentation Efficient Algorithms For Listing Combinatorial Structures Format Relié
- Livre
Résumé :
First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures.
Sommaire:
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....