Results 1 to 10 of about 2,624,695 (120)
Bounds for minimum feedback vertex sets in distance graphs and circulant graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Graphs and ...
Hamamache Kheddouci, Olivier Togni
doaj +3 more sources
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Graphs and ...
Serge Gaspers, Mathieu Liedloff
doaj +1 more source
Partially complemented representations of digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2002 Special issue: Graph ...
Elias Dahlhaus +2 more
doaj +1 more source
Why almost all satisfiable $k$-CNF formulas are easy [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Finding a satisfying assignment for a $k$-CNF formula $(k \geq 3)$, assuming such exists, is a notoriously hard problem. In this work we consider the uniform distribution over satisfiable $k$-CNF formulas with a linear number of clauses (clause-variable ...
Amin Coja-Oghlan +2 more
doaj +1 more source
The Euclid Algorithm is totally gaussian [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We consider Euclid’s gcd algorithm for two integers $(p, q)$ with $1 \leq p \leq q \leq N$, with the uniform distribution on input pairs. We study the distribution of the total cost of execution of the algorithm for an additive cost function $d$ on the ...
Brigitte Vallée
doaj +1 more source
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness [PDF]
, 2021 We study the complexity of isomorphism problems for tensors, groups, and polynomials. These problems have been studied in multivariate cryptography, machine learning, quantum information, and computational group theory.
Grochow, Joshua A., Qiao, Youming
core +1 more source
Boltzmann Oracle for Combinatorial Systems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Boltzmann random generation applies to well-defined systems of recursive combinatorial equations. It relies on oracles giving values of the enumeration generating series inside their disk of convergence.
Carine Pivoteau +2 more
doaj +1 more source
Generic properties of random subgroups of a free group for general distributions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We consider a generalization of the uniform word-based distribution for finitely generated subgroups of a free group. In our setting, the number of generators is not fixed, the length of each generator is determined by a random variable with some simple ...
Frédérique Bassino +2 more
doaj +1 more source
Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 In this paper we address the problem of understanding Concurrency Theory from a combinatorial point of view. We are interested in quantitative results and algorithmic tools to refine our understanding of the classical combinatorial explosion phenomenon ...
OLivier Bodini +3 more
doaj +1 more source
Around the root of random multidimensional quadtrees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We analyse the distribution of the root pattern of randomly grown multidimensional point quadtrees. In particular, exact, recursive and asymptotic formulas are given for the expected arity of the root.
Gilbert Labelle +2 more
doaj +1 more source