Free shipping on all orders over $79* Limited Time Only
Track My Order
Help Centre
Likes
My Wish ListsLogin / Join
Booktopia
Australia's local bookstore
Get Free Shipping on orders over $79
Efficient Algorithms for Listing Combinatorial Structures : Distinguished Dissertations in Computer Science - No Information Available

Efficient Algorithms for Listing Combinatorial Structures

By: No Information Available

Hardcover | 21 June 1993

At a Glance

Hardcover

RRP $219.95

$192.99

12%OFF

or 4 interest-free payments of $48.25 with

 or 

Ships in 5 to 7 business days

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.
Industry Reviews
"...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 "By any standard, this is an exceptional dissertation. It is well written, with the author always explaining the thrust of the argument, never allowing the technical nature of many of the results to obscure the overall picture. The author has built up a substantial theory..." G.F. Royle, Computing Reviews "...an impressive and thorough examination of listing problems in this framework...the complicated probabilistic arguments needed for the analysis are handled well...this is an exceptional dissertation...well-written, with the author always carefully explaining the thrust of the argument, never allowing the technical nature of many of the results to obscure the overall picture." G.F. Royle, Mathematics of Computing

You Can Find This Book In

Non-FictionComputing & I.T.Computer ScienceMathematicsCombinatorics & Graph TheoryComputer Programming & Software Development

More in Combinatorics & Graph Theory

Foundations of Graph Theory - Peter Griffin

Foundations of Graph Theory

Hardcover

$461.99

Foundations of Graph Theory - Peter Griffin

Foundations of Graph Theory

Hardcover

$461.99

Discrete Mathematics for Data Science - Jack Pope

Discrete Mathematics for Data Science

Hardcover

RRP $179.00

$158.99

11%
OFF
Discrete Mathematics for Data Science - Jack Pope

Discrete Mathematics for Data Science

Paperback

RRP $103.00

$91.75

11%
OFF
A First Look At Graph Theory - John Clark

A First Look At Graph Theory

Paperback

RRP $88.99

$80.75

Principles And Techniques In Combinatorics - Chuan Chong Chen

Principles And Techniques In Combinatorics

Paperback

RRP $70.99

$63.99

10%
OFF
Milestones in Graph Theory : A Century of Progress - Lowell W. Beineke

Milestones in Graph Theory

A Century of Progress

Paperback

RRP $160.00

$154.75

SEL PROB VIETNAMESE MATH'L..(V5) : Mathematical Olympiad - CHAU LE HAI

SEL PROB VIETNAMESE MATH'L..(V5)

Mathematical Olympiad

Paperback

RRP $70.99

$28.00

61%
OFF
PRINCIPLES AND TECHNIQUES IN COMBINATORICS : SOLUTIONS MANUAL - MINGYAN KEAN PEW FOO &

PRINCIPLES AND TECHNIQUES IN COMBINATORICS

SOLUTIONS MANUAL

Paperback

RRP $81.99

$73.99

10%
OFF

This product is categorised by