Algorithms to estimate the number of k-colorings of a low-degree graph using samplings from a markov chain are provided.
Browse Files for Approximate Counting of Graph Colorings
| File/Folder Name | Platform | Size | Date ↓ | Downloads | Notes/Subscribe |
|---|---|---|---|---|---|
| Newest Files | |||||
| acgc-1.0.zip | 3.0 MB | 2007-02-02 | 54 | Release Notes | |
| All Files | Subscribe | ||||
| acgc | 3.0 MB | 2007-02-02 | 54 | Subscribe Folder view | |
| acgc-1.0 | 3.0 MB | 2007-02-02 | 54 | Subscribe Folder view | |
| acgc-1.0.zip | 3.0 MB | 2007-02-02 | 54 | Release Notes | |
About SourceForge
Develop Software
Community
Copyright © 2009 Geeknet, Inc. All rights reserved. Terms of Use
