Goldberg L Efficient Algorithms for Listing Combinatorial Structures 2009

Goldberg L Efficient Algorithms for Listing Combinatorial Structures 2009 | 3.92 MB
176 Pages

Title: Efficient Algorithms for Listing Combinatorial Structures
Author: Leslie Ann Goldberg

Description:
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.

DOWNLOAD:

https://rapidgator.net/file/0a208073611c6fbc1fa89f1c89ecdcdb/Goldberg_L._Efficient_Algorithms_for_Listing_Combinatorial_Structures_2009.rar
https://k2s.cc/file/99bf6a34ce198/Goldberg_L._Efficient_Algorithms_for_Listing_Combinatorial_Structures_2009.rar

We need your support!
Make a donation to help us stay online
        
Bitcoin (BTC)
bc1q08g9d22cxkawsjlf8etuek2pc9n2a3hs4cdrld
	
Bitcoin Cash (BCH)
qqvwexzhvgauxq2apgc4j0ewvcak6hh6lsnzmvtkem

Ethereum (ETH)
0xb55513D2c91A6e3c497621644ec99e206CDaf239

Litecoin (LTC)
ltc1qt6g2trfv9tjs4qj68sqc4uf0ukvc9jpnsyt59u

USDT (ERC20)
0xb55513D2c91A6e3c497621644ec99e206CDaf239

USDT (TRC20)
TYdPNrz7v1P9riWBWZ317oBgJueheGjATm