Results 1 to 10 of about 477 (109)
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
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
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
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
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
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
Influence of the tie-break rule on the end-vertex problem [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 End-vertices of a given graph search may have some nice properties, as for example it is well known that the last vertex of Lexicographic Breadth First Search (LBFS) in a chordal graph is simplicial, see Rose, Tarjan and Lueker 1976.
Pierre Charbit +2 more
doaj +1 more source
Power domination in maximal planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Power domination in graphs emerged from the problem of monitoring an electrical system by placing as few measurement devices in the system as possible. It corresponds to a variant of domination that includes the possibility of propagation.
Paul Dorbec +2 more
doaj +1 more source