-
Paths with two blocks in $n$-chromatic digraphs
We show that every oriented path of order $n\geq4$ with two blocks is contained in every $n$-chromatic digraph. -
Optimal Solution of the Maximum All Request Path Grooming Problem
We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding... -
Contraintes linguistiques, cognitives et culturelles dans l'expression d'évén...
International audience -
From NoC Security Analysis To Design Solutions
This paper addresses a new kind of security vulnerable spots introduced by Network-on-chip (NoC) use in System-on-Chip (SoC) design. This study is based on the... -
Exact computation of emergy based on a mathematical reinterpretation of the r...
cited By (since 1996)5 -
Edge Decompositions of Hypercubes by Paths and by Cycles
International audience -
Answering SPARQL queries modulo RDF Schema with paths
alkhateeb2013a -
The b-chromatic number of power graphs
International audience
