Results 11 to 20 of about 2,350 (110)
A conjecture on the number of Hamiltonian cycles on thin grid cylinder graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Olga Bodroža-Pantić +2 more
doaj +1 more source
Intervals and factors in the Bruhat order [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Combinatorics
Bridget Eileen Tenner
doaj +1 more source
Weak Positional Games on Hypergraphs of Rank Three [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 In a weak positional game, two players, Maker and Breaker, alternately claim vertices of a hypergraph until either Maker wins by getting a complete edge or all vertices are taken without this happening, a Breaker win.
Martin Kutz
doaj +1 more source
Maximal sets of integers not containing $k+1$ pairwise coprimes and having divisors from a specified set of primes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We find the formula for the cardinality of maximal set of integers from $[1,\ldots,n]$ which does not contain $k+1$ pairwise coprimes and has divisors from a specified set of primes.
Vladimir Blinovsky
doaj +1 more source
Quadratic LYM-type inequalities for intersecting Sperner families [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Let $\mathcal{F}\subseteq 2^{[n]}$ be a intersecting Sperner family (i.e. $A \not\subset B, A \cap B \neq \emptyset$ for all $A,B \in \mathcal{F}$) with profile vector $(f_i)_{i=0 \ldots n}$ (i.e. $f_i=|\mathcal{F} \cap \binom{[n]}{i}|$).
Christian Bey
doaj +1 more source
Enumeration of walks reaching a line [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We enumerate walks in the plane $\mathbb{R}^2$, with steps East and North, that stop as soon as they reach a given line; these walks are counted according to the distance of the line to the origin, and we study the asymptotic behavior when the line has a
Philippe Nadeau
doaj +1 more source
Cost-effectiveness of algorithms [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Discrete ...
Graham Farr
doaj +1 more source
On-line coloring of $I_s$-free graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 An on-line vertex coloring algorithm receives vertices of a graph in some externally determined order. Each new vertex is presented together with a set of the edges connecting it to the previously presented vertices.
Iwona Cieslik, Marcin Kozik, Piotr Micek
doaj +1 more source
On-line Adaptive Chain Covering of Upgrowing Posets [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We analyze on-line chain partitioning problem and its variants as a two-person game. One person (Spoiler) builds an on-line poset presenting one point at time. The other one (Algorithm) assigns new point to a chain.
Bartłomiej Bosek, Piotr Micek
doaj +1 more source
Is spoken language all-or-nothing? Implications for future speech-based human-machine interaction [PDF]
, 2016 Recent years have seen significant market penetration for voice-based personal assistants such as Apple’s Siri. However, despite this success, user take-up is frustratingly low.
A Fernald +30 more
core +2 more sources