Star Wars Sale
 
 

Special Offers see all

Enter to WIN!

Weekly drawing for $100 credit. Subscribe to PowellsBooks.news for a chance to win.
Privacy Policy

More at Powell's


Recently Viewed clear list


Original Essays | June 20, 2014

Lisa Howorth: IMG So Many Books, So Many Writers



I'm not a bookseller, but I'm married to one, and Square Books is a family. And we all know about families and how hard it is to disassociate... Continue »

spacer

Distinguished Dissertations in Computer Science #5: Efficient Algorithms for Listing Combinatorial Structures

by

Distinguished Dissertations in Computer Science #5: Efficient Algorithms for Listing Combinatorial Structures Cover

 

Synopses & Reviews

Publisher Comments:

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 that are of interest to theoretical computer scientists and combinatorialists? Among those families considered are unlabeled graphs, first-order one properties, Hamiltonian graphs, graphs with cliques of specified order, and k-colorable graphs. Some related work is also included that 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 Polya's cycle polynomial is demonstrated.

Synopsis:

First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures.

Product Details

ISBN:
9780521117883
Author:
Goldberg, Leslie Ann
Publisher:
Cambridge University Press
Author:
Leslie Ann, Goldberg
Subject:
General
Subject:
Mathematics - General
Series:
Distinguished Dissertations in Computer Science
Series Volume:
5
Publication Date:
20090431
Binding:
TRADE PAPER
Language:
English
Pages:
180
Dimensions:
9.61x6.69x.38 in. .65 lbs.

Related Subjects

Computers and Internet » Computers Reference » General
Science and Mathematics » Mathematics » General

Distinguished Dissertations in Computer Science #5: Efficient Algorithms for Listing Combinatorial Structures New Trade Paper
0 stars - 0 reviews
$54.95 In Stock
Product details 180 pages Cambridge University Press - English 9780521117883 Reviews:
"Synopsis" by , First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures.
spacer
spacer
  • back to top
Follow us on...




Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.