Efficient Algorithms for Listing Combinatorial Structures

AvLeslie Ann Goldberg

Inbunden, Engelska, 1993

Del 5 i serien Distinguished Dissertations in Computer Science

1 579 kr

Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Häftad

653 kr

Beskrivning

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.

Produktinformation

Utgivningsdatum:1993-04-22
Mått:179 x 253 x 14 mm
Vikt:505 g
Format:Inbunden
Språk:Engelska
Serie:Distinguished Dissertations in Computer Science
Antal sidor:178
Förlag:Cambridge University Press
ISBN:9780521450218

Utforska kategorier

Recensioner i media

"...selected as one of the three best theses in computer science in the UK in 1992....makes an important contribution to the complexity theory of listing and counting combinatorial structures....gives new and interesting results..." Mathematical Reviews

Innehållsförteckning

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.

Mer från samma författare

Automata, Languages and Programming

Igor Walukiewicz, Anna Ingolfsdottir, Magnus M. Halldorsson, Leslie Ann Goldberg, Ivan Damgaard, Luca Aceto

E-bok

2008

2 081 kr

Automata, Languages and Programming

Luca Aceto, Ivan Damgaard, Leslie Ann Goldberg, Magnus M. Halldorsson, Anna Ingolfsdottir, Igor Walukiewicz

Häftad, 2008

1 136 kr

Automata, Languages and Programming

Igor Walukiewicz, Anna Ingolfsdottir, Magnus M. Halldorsson, Leslie Ann Goldberg, Ivan Damgaard, Luca Aceto

E-bok

2008

1 427 kr

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D.P. Rolim

Häftad, 2011

572 kr

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Jose D.P. Rolim, R. Ravi, Klaus Jansen, Leslie Ann Goldberg

E-bok

2011

718 kr

Mer från samma serie

Del 10

Affine Analysis of Image Sequences

Larry S. Shapiro

Häftad, 2005

653 kr

Del 8

Functional Programming and Input/Output

Andrew D. Gordon

Häftad, 2008

672 kr

Del 2

Three-Dimensional Integrated Circuit Layout

A. C. Harter

Häftad, 2009

721 kr

Del 11

A Modular and Extensible Network Storage Architecture

Sai Lai Lo

Häftad, 2011

552 kr

Del 2

Three-Dimensional Integrated Circuit Layout

A. C. Harter

Inbunden, 1991

1 682 kr

Del 6

Specification and Proof in Real Time CSP

Jim Davies

Inbunden, 1993

1 626 kr

Del 13

The Map-Building and Exploration Strategies of a Simple Sonar-Equipped Mobile Robot

D. C. Lee

Häftad, 2003

653 kr

Del 9

Qualified Types

Mark P. Jones

Häftad, 2003

672 kr

Del 11

A Modular and Extensible Network Storage Architecture

Sai Lai Lo

Inbunden, 1995

1 985 kr

Del 14

Axiomatic Domain Theory in Categories of Partial Maps

Marcelo P. Fiore

Häftad, 2004

700 kr

Du kanske också är intresserad av

10% rabatt på allt

Exit Adventskalender - Julens magi (SE)

Exit

499 kr

Del 5