Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Efficient Algorithms for Listing Combinatorial Structures - Leslie Ann Goldberg

Efficient Algorithms for Listing Combinatorial Structures

Buch | Hardcover
178 Seiten
1993
Cambridge University Press (Verlag)
978-0-521-45021-8 (ISBN)
CHF 189,95 inkl. MwSt
First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. 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.
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.

1. Introduction; 2. Techniques for listing combinatorial structures; 3. Applications to particular families of structures; 4. Directions for future work on listing; 5. Related results; 6. Bibliography.

Erscheint lt. Verlag 22.4.1993
Reihe/Serie Distinguished Dissertations in Computer Science
Verlagsort Cambridge
Sprache englisch
Maße 170 x 244 mm
Gewicht 490 g
Themenwelt Mathematik / Informatik Informatik
Mathematik / Informatik Mathematik Graphentheorie
ISBN-10 0-521-45021-7 / 0521450217
ISBN-13 978-0-521-45021-8 / 9780521450218
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Numbers and Counting, Groups, Graphs, Orders and Lattices

von Volker Diekert; Manfred Kufleitner; Gerhard Rosenberger …

Buch | Softcover (2023)
De Gruyter (Verlag)
CHF 89,95