Results 51 to 60 of about 698 (72)
Largest reduced neighborhood clique cover number revisited
, 2017 Let $G$ be a graph and $t\ge 0$. The largest reduced neighborhood clique cover number of $G$, denoted by ${\hat\beta}_t(G)$, is the largest, overall $t$-shallow minors $H$ of $G$, of the smallest number of cliques that can cover any closed neighborhood ...
Brown, André EX +11 more
core +3 more sources
A Danzer set for Axis Parallel Boxes [PDF]
, 2015 We present concrete constructions of discrete sets in $\mathbb{R}^d$ ($d\ge 2$) that intersect every aligned box of volume $1$ in $\mathbb{R}^d$, and which have optimal growth rate $O(T^d)$
Simmons, David, Solomon, Yaar
core +3 more sources
Combinatorial Dominance Guarantees for Heuristic Algorithms [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 An $f(n)$ $\textit{dominance bound}$ on a heuristic for some problem is a guarantee that the heuristic always returns a solution not worse than at least $f(n)$ solutions.
Daniel Berend +2 more
doaj +1 more source
Coherent random permutations with record statistics [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 A two-parameter family of random permutations of $[n]$ is introduced, with distribution conditionally uniform given the counts of upper and lower records. The family interpolates between two versions of Ewens' distribution.
Alexander Gnedin
doaj +1 more source
Expected values of statistics on permutation tableaux [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Permutation tableaux are new objects that were introduced by Postnikov in the context of enumeration of the totally positive Grassmannian cells. They are known to be in bijection with permutations and recently, they have been connected to PASEP model ...
Sylvie Corteel, Pawel Hitczenko
doaj +1 more source
Performance Evaluation of Demodulation Methods: a Combinatorial Approach [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 This paper provides a combinatorial approach for analyzing the performance of demodulation methods used in GSM. We also show how to obtain combinatorially a nice specialization of an important performance evaluation formula, using its connection with a ...
Daniel Krob, Ekaterina A. Vassilieva
doaj +1 more source
Osculating Random Walks on Cylinders [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 We consider random paths on a square lattice which take a left or a right turn at every vertex. The possible turns are taken with equal probability, except at a vertex which has been visited before.
Saibal Mitra, Bernard Nienhuis
doaj +1 more source
Average properties of combinatorial problems and thermodynamics of spin models on graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 The study of thermodynamic properties of classical spin models on infinite graphs naturally leads to consider the new combinatorial problems of random-walks and percolation on the average.
Alessandro Vezzani +2 more
doaj +1 more source
Partitions of an Integer into Powers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 In this paper, we use a simple discrete dynamical model to study partitions of integers into powers of another integer. We extend and generalize some known results about their enumeration and counting, and we give new structural results.
Matthieu Latapy
doaj +1 more source
Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions [PDF]
, 2011 Motivated by low energy consumption in geographic routing in wireless networks, there has been recent interest in determining bounds on the length of edges in the Delaunay graph of randomly distributed points.
Anta, Antonio Fernandez +3 more
core +1 more source