Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Polynôme sans carré

Publications associées (23)

Sorting signed permutations by inversions in O(nlogn) time

Bernard Moret, Yu Lin, Krister Swenson, Vaibhav Rajan

The study of genomic inversions (or reversals) has been a mainstay of computational genomics for nearly 20 years. After the initial breakthrough of Hannenhalli and Pevzner, who gave the first polynomial-time algorithm for sorting signed permutations by inv ...

Springer2009

A Magnetic Procedure for the Stability Number

Dominique de Werra

A magnet is a pair u, v of adjacent vertices such that the proper neighbours of u are completely linked to the proper neighbours of v. It has been shown that one can reduce the graph by removing the two vertices u, v of a magnet and introducing a new verte ...

2009

Stability and Delay Bounds in Heterogeneous Networks of Aggregate Schedulers

Jean-Yves Le Boudec, Gianluca Rizzo

Aggregate scheduling is one of the most promising solutions to the issue of scalability in networks, like DiffServ networks and high speed switches, where hard QoS guarantees are required. For networks of FIFO aggregate schedulers, the main existing suffic ...

2008