Contatto
Come acquistare
Consegna
Guida all'acquisto
Efficient Algorithms for Listing Combinatorial Structures
Inglese
137 b
30 giorni per il reso
I clienti hanno acquistato anche
/
binding.
34.59
€
/
In brossura
16.89
€
/
In brossura
16.89
€
/
In brossura
46.59
€
/
In brossura
31.29
€
/
In brossura
23.49
€
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.
Informazioni sul libro
Inglese
Regala questo libro oggi stesso
È facile
1 Aggiungi il libro al carrello e scegli la consegna come regalo 2 Ti invieremo subito il buono 3 Il libro arriverà all'indirizzo del destinatarioPotrebbe interessarti anche
/
In brossura
78.69
€
/
In brossura
24.79
€
/
In brossura
10.69
€
/
Rigido
102.39
€
/
Rigido
237.69
€