efficient algorithms listing combinatorial von goldberg (6 Ergebnisse)

Zustand: Acceptable. Used - Acceptable. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library with wear and barcode page may have been removed. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.

Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. 9780521450218 Sprache: Englisch Gewicht in Gramm: 990.

Zustand: New. In.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Zustand: New. In.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.