Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Mathematics Of Computing (G) > Discrete Mathematics (G.2) > Combinatorics (G.2.1)
 
  Combinatorics (G.2.1) See Reviews  
 
Subject Descriptors:
Combinatorial Algorithms (155)
Counting Problems (29)
Generating Functions (24)
Permutations And Combinations (66)
Recurrences And Difference Equations (24)
 
Proper Nouns:
There are no proper nouns with reviews under G.2.1.
 
 
Reviews limited to:
 
 

Reviews about "Combinatorics (G.2.1)":
Counting and generating permutations in regular classes
Basset N.  Algorithmica 76(4): 989-1034, 2016. Type: Article
A GPU-based branch-and-bound algorithm using IntegerVectorMatrix data structure
Gmys J., Mezmaz M., Melab N., Tuyttens D.  Parallel Computing 59(C): 119-139, 2016. Type: Article
An introduction to Catalan numbers
Roman S.,  Springer, New York, NY, 2015. 121 pp. Type: Book (978-3-319221-43-4)
New complete Latin squares of odd order
Ollis M.  European Journal of Combinatorics 4135-46, 2014. Type: Article
ReCombinatorics: the algorithmics of ancestral recombination graphs and explicit phylogenetic networks
Gusfield D.,  The MIT Press, Cambridge, MA, 2014. 600 pp. Type: Book (978-0-262027-52-6)
 The Merino-Welsh conjecture holds for series-parallel graphs
Noble S., Royle G.  European Journal of Combinatorics 3824-35, 2014. Type: Article
Combinatorial search: from algorithms to systems
Hamadi Y.,  Springer Publishing Company, Incorporated, New York, NY, 2013. 170 pp. Type: Book (978-3-642414-81-7), Reviews: (2 of 2)
more...
Related Topics
G.2.1 Combinatorics
  - Nonnumerical Algorithms And Problems
   
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2017 ThinkLoud, Inc.
Terms of Use
| Privacy Policy