|
Browse All Reviews > Mathematics Of Computing (G) > Discrete Mathematics (G.2) > Combinatorics (G.2.1)
|
|
|
|
|
|
|
|
|
1-10 of 168
Reviews about "Combinatorics (G.2.1)":
|
Date Reviewed |
|
Algorithm and symbolic combinatorics: an invitation to analytic combinatorics in several variables Melczer S., Springer International Publishing, New York, NY, 2021. 436 pp. Type: Book (978-3-030670-79-5)
Analytic combinatorics is a powerful branch of modern mathematics with several applications to physics and computer science, not to speak of mathematics itself. Melczer has done a good job of mathematically encompassing the issues rela...
|
Aug 17 2022 |
|
Exploring the prediction of variety-seeking behavior Li J., Zhao J., Mao M., Zhao X., Zou J. DSIT 2019 (Proceedings of the 2nd International Conference on Data Science and Information Technology, Seoul, South Korea, Jul 19-21, 2019) 59-63, 2019. Type: Proceedings
Modern marketing applies data analytics to determine measures that influence a customer’s future purchase decisions based on past behavior. One aspect of this behavior is that customers like to vary their purchases over time ...
|
Oct 23 2019 |
|
Asymptotic medians of random permutations sampled from reversal random walks Jamshidpey A., Sankoff D. Theoretical Computer Science 698 9-13, 2017. Type: Article
The area of application of this interesting, and quite advanced, five-page paper is in the study of genomics and chromosomal rearrangements. The median specified in the title “is a point whose sum of distances to k
|
Feb 15 2018 |
|
Counting and generating permutations in regular classes Basset N. Algorithmica 76(4): 989-1034, 2016. Type: Article
The signature of a permutation can be described in terms of two symbols that represent ascent and descent in the ordering of the elements. For each regular language (that can be recognized by a finite-state automaton) over those two sy...
|
May 19 2017 |
|
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
Gmys et al. address the parallelization of the popular branch-and-bound (B&B) algorithm for solving combinatorial optimization problems using graphics processing units (GPUs). The irregular structure of B&B makes it challenging...
|
May 17 2017 |
|
An introduction to Catalan numbers Roman S., Springer, New York, NY, 2015. 121 pp. Type: Book (978-3-319221-43-4)
Catalan numbers are numbers that fall into that branch of mathematics referred to as combinatorics, or numbers that create a pattern of some type. In a more general sense, Catalan numbers can be considered as a major topic in number th...
|
Apr 4 2016 |
|
New complete Latin squares of odd order Ollis M. European Journal of Combinatorics 4135-46, 2014. Type: Article
A square grid of n symbols arranged in n rows and columns, such that each symbol appears once in each row and each column, is called a Latin square of order n. Such squares are o...
|
May 20 2015 |
|
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 primary objective in the area of phylogenetic trees is to construct a tree where leaf nodes represent extant species, internal nodes represent (possibly hypothesized) ancestors, and edges represent relationships between species. Th...
|
Jan 8 2015 |
|
The Merino-Welsh conjecture holds for series-parallel graphs Noble S., Royle G. European Journal of Combinatorics 3824-35, 2014. Type: Article
Orientation is an assignment of direction to each edge of an undirected graph. When none of the directed edges is in a cycle, the orientation is called acyclic. When every directed edge is in some cycle, the orientation is called total...
|
Aug 20 2014 |
|
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)
The focus of this book is knowledge sharing in combinatorial search, a topic that is of considerable current importance in the quest for solutions to NP-hard problems. Operations research professionals and computer scientists alike wil...
|
May 22 2014 |
|
|
|
|
|
|