Results 41 to 50 of about 212 (69)
Properties of Random Graphs via Boltzmann Samplers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 This work is devoted to the understanding of properties of random graphs from graph classes with structural constraints. We propose a method that is based on the analysis of the behaviour of Boltzmann sampler algorithms, and may be used to obtain precise
Konstantinos Panagiotou, Andreas Weißl
doaj +1 more source
Discrete Mathematics & Theoretical Computer Science, 2005 We consider the $\textit{master ring problem (MRP)}$ which often arises in optical network design. Given a network which consists of a collection of interconnected rings $R_1, \ldots, R_K$, with $n_1, \ldots, n_K$ distinct nodes, respectively, we need to
Hadas Shachnai, Lisa Zhang
doaj +1 more source
Concentration Properties of Extremal Parameters in Random Discrete Structures [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 The purpose of this survey is to present recent results concerning concentration properties of extremal parameters of random discrete structures. A main emphasis is placed on the height and maximum degree of several kinds of random trees. We also provide
Michael Drmota
doaj +1 more source
Randomized Optimization: a Probabilistic Analysis [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 In 1999, Chan proposed an algorithm to solve a given optimization problem: express the solution as the minimum of the solutions of several subproblems and apply the classical randomized algorithm for finding the minimum of $r$ numbers.
Jean Cardinal +2 more
doaj +1 more source
Bipartite Random Graphs and Cuckoo Hashing [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 The aim of this paper is to extend the analysis of Cuckoo Hashing of Devroye and Morin in 2003. In particular we make several asymptotic results much more precise.
Reinhard Kutzelnigg
doaj +1 more source
A coupon collector's problem with bonuses [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 In this article, we study a variant of the coupon collector's problem introducing a notion of a \emphbonus. Suppose that there are c different types of coupons made up of bonus coupons and ordinary coupons, and that a collector gets every coupon with ...
Toshio Nakata, Izumi Kubo
doaj +1 more source
The Diameter of the Minimum Spanning Tree of a Complete Graph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 Let $X_1,\ldots,X_{n\choose 2}$ be independent identically distributed weights for the edges of $K_n$. If $X_i \neq X_j$ for$ i \neq j$, then there exists a unique minimum weight spanning tree $T$ of $K_n$ with these edge weights.
Louigi Addario-Berry +2 more
doaj +1 more source
On the Ehrenfeucht-Mycielski Balance Conjecture [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 In 1992, A. Ehrenfeucht and J. Mycielski defined a seemingly pseudorandom binary sequence which has since been termed the EM-sequence. The balance conjecture for the EM-sequence, still open, is the conjecture that the sequence of EM-sequence initial ...
John C. Kieffer, W. Szpankowski
doaj +1 more source
Stokes polyhedra for $X$-shaped polyminos [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Consider a pair of $\textit{interlacing regular convex polygons}$, each with $2(n + 2)$ vertices, which we will be referring to as $\textit{red}$ and $\textit{black}$ ones.
Yu. Baryshnikov +3 more
doaj +1 more source
Human behavior in image-based Road Health Inspection Systems despite the emerging AutoML. [PDF]
J Big Data, 2022 Siriborvornratanakul T.
europepmc +1 more source