Fabrice Philippe

most citedGenerating connected acyclic digraphs uniformly at random

2 citations · 2 across the 3 of their papers we have counts for

collaborators

3 papers

math.NT2012

On the maximal weight of $(p, q)$ -ary chain partitions with bounded parts

Filippo Disanto, Laurent Imbert, Fabrice Philippe

A $(p, q)$ -ary chain is a special type of chain partition of integers with parts of the form $p^{a} q^{b}$ for some fixed integers $p$ and $q$ . In this note, we are interested in the max…

math.NT2012

Strictly chained (p,q)-ary partitions

Laurent Imbert, Fabrice Philippe

We consider a special type of integer partitions in which the parts of the form $p^{a} q^{b}$ , for some relatively prime integers $p$ and $q$ , are restricted by divisibility conditions.…

cs.DM2004★ 2 cited

Generating connected acyclic digraphs uniformly at random

Guy Melancon, Fabrice Philippe

We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of…

On the maximal weight of (p,q)-ary chain partitions with bounded parts

Strictly chained (p,q)-ary partitions

Generating connected acyclic digraphs uniformly at random

On the maximal weight of $(p, q)$ -ary chain partitions with bounded parts