Kontakt
Wie einkaufen
Versand
Kaufberater
Efficient Algorithms for Listing Combinatorial Structures
Englisch
373 b
30 Tage für die Rückgabe der Ware
Kunden kauften auch
/
Broschur
19.09
€
/
Broschur
74.00
€
/
Broschur
17.95
€
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.
Informationen zum Buch
Englisch
Verschenken Sie dieses Buch noch heute
Es ist ganz einfach
1 Legen Sie das Buch in Ihren Warenkorb und wählen Sie den Versand als Geschenk 2 Wir schicken Ihnen umgehend einen Gutschein 3 Das Buch wird an die Adresse des beschenkten Empfängers geliefertDas könnte Sie auch interessieren
/
Broschur
11.29
€
/
Broschur
21.99
€
/
Broschur
53.79
€