Results 1  10
of
760
Combinatorial Enumeration in Chemistry
"... In this report we review the literature in the area of combinatorial enumeration in chemistry published in the last two years – from June 2001 to May 2003. In our earlier report we presented historically important isomer enumerations, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this report we review the literature in the area of combinatorial enumeration in chemistry published in the last two years – from June 2001 to May 2003. In our earlier report we presented historically important isomer enumerations,
The Preliminary Design Of An ObjectOriented Framework For Combinatorial Enumeration
 in proceedings of the Colloquium on Object Orientation in Databases and Software Engineering, 62nd Congress of ACFAS
, 1994
"... The design of an objectoriented framework for combinatorial enumeration is described. Combinatorial enumeration requires a subtle interplay between the search mechanism, the ordering of the space of combinatorial objects, and the symmetries used to prune equivalent cases from the search. Efficiency ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The design of an objectoriented framework for combinatorial enumeration is described. Combinatorial enumeration requires a subtle interplay between the search mechanism, the ordering of the space of combinatorial objects, and the symmetries used to prune equivalent cases from the search
Overview of some general results in combinatorial enumeration
, 2008
"... This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and hypergraphs, relational structures, and others. The second part ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and hypergraphs, relational structures, and others. The second part
A Combinatorial Enumeration Approach For Measuring Anonymity
, 2009
"... A recent paper (Edman et al. [6]) has taken a combinatorial approach to measuring the anonymity of a threshold mix anonymous communications system. Their paper looks at ways of matching individual messages sent to individual messages received, irrespective of user, and determines a measure of the an ..."
Abstract
 Add to MetaCart
of the anonymity provided by the system. Here we extend this approach to include in the calculation information about how many messages were sent or received by a user and we define a new metric that can be computed exactly and efficiently using classical and elegant techniques from combinatorial enumeration. 1
Exhaustive Combinatorial Enumeration Mathieu Dutour Sikirić
"... and the algorithmCombinatorial enumeration ◮ Example of problem considered: ◮ List all 3valent plane graphs with faces of gonality 5 and 9 and all 9gonal faces in pairs. ◮ List all independent sets of 600cell. ◮ List all triangulations of the sphere on n vertices. ◮ List all isohedral (r, q)poly ..."
Abstract
 Add to MetaCart
and the algorithmCombinatorial enumeration ◮ Example of problem considered: ◮ List all 3valent plane graphs with faces of gonality 5 and 9 and all 9gonal faces in pairs. ◮ List all independent sets of 600cell. ◮ List all triangulations of the sphere on n vertices. ◮ List all isohedral (r, q
GEOMETRY OF q AND q, tANALOGS IN COMBINATORIAL ENUMERATION
"... The aim of these lectures was to give an overview of some combinatorial, symmetricfunction theoretic, and representationtheoretic developments during the last several years in the theory of HallLittlewood and Macdonald polynomials. The motivating problem for all these developments was Macdonald’s ..."
Abstract
 Add to MetaCart
The aim of these lectures was to give an overview of some combinatorial, symmetricfunction theoretic, and representationtheoretic developments during the last several years in the theory of HallLittlewood and Macdonald polynomials. The motivating problem for all these developments was Macdonald’s
PARTITION FUNCTIONS FOR DENSE INSTANCES OF COMBINATORIAL ENUMERATION PROBLEMS
, 2013
"... Abstract. Given a complete graph with positive weights on its edges, we define the weight of a subset of edges as the product of weights of the edges in the subset and consider sums (partition functions) of weights over subsets of various kinds: cycle covers, closed walks, spanning trees. We show th ..."
Abstract
 Add to MetaCart
Abstract. Given a complete graph with positive weights on its edges, we define the weight of a subset of edges as the product of weights of the edges in the subset and consider sums (partition functions) of weights over subsets of various kinds: cycle covers, closed walks, spanning trees. We show that if the weights of the edges of the graph are within a constant factor, fixed in advance, of each other then the bulk of the partition function is concentrated on the subsets of a particularly simple structure: cycle covers with few cycles, walks that visit every vertex only few times, and spanning trees with small degree of every vertex. This allows us to construct a polynomial time algorithm to separate graphs with many Hamiltonian cycles from graphs that are sufficiently far from Hamiltonian. 1. Introduction and
SYSTEMS OF FUNCTIONAL EQUATIONS AND INFINITE DIMENSIONAL GAUSSIAN LIMITING DISTRIBUTIONS IN COMBINATORIAL ENUMERATION
"... In this paper systems of functional equations in infinitely many variables arising in combinatorial enumeration problems are studied. We prove sufficient conditions under which the combinatorial random variables encoded in the generating functions of the system tend to an infinite dimensional Gauss ..."
Abstract
 Add to MetaCart
In this paper systems of functional equations in infinitely many variables arising in combinatorial enumeration problems are studied. We prove sufficient conditions under which the combinatorial random variables encoded in the generating functions of the system tend to an infinite dimensional
Results 1  10
of
760